#include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <cmath>

 #define sqr(x) ((x)*(x))

 using namespace std;

 const int M=;

 const int N=;

 int inv[M],mat[N][N];

 void init(){//求逆元

     inv[]=;

     for(int i=;i<M;i++)

         inv[i]=(M-M/i)*inv[M%i]%M;

 }

 int det(int c[][N],int n){//求矩阵c的n阶顺序主子式的绝对值

     int i,j,k,w=,ans=;

     for(i=;i<=n;i++)

     for(j=;j<=n;j++) c[i][j]=(c[i][j]%M+M)%M;

     for(i=;i<=n;i++){

         for(j=i;j<=n;j++)//找出第i行起第i列不为0的行

             if(c[i][j])break;

         if(i!=j)

             swap(c[i],c[j]);

         ans=ans*c[i][i]%M;

         for(j=i+;j<=n;j++)//第j行第i列变为0

         for(k=n+;k>i;k--)//该行每列减去第i列的值*d

             c[j][k]=(c[j][k]-c[i][k]*inv[c[i][i]]%M*c[j][i]%M+M)%M;

     }

     return ans;

 }

 struct point{

     int x,y;

 }p[N];

 int same(point a,point b,point c){   //判断是否共线

     return (a.x-c.x)*(b.y-c.y)==(b.x-c.x)*(a.y-c.y)

     &&min(a.x,c.x)<=b.x&&max(a.x,c.x)>=b.x

     &&min(a.y,c.y)<=b.y&&max(a.y,c.y)>=b.y;

 }

 int main(){

     init();

     int t,n,r;

     scanf("%d",&t);

     while(t--){

         memset(mat,,sizeof mat);

         scanf("%d%d",&n,&r);

         for(int i=;i<=n;i++)

             scanf("%d%d",&p[i].x,&p[i].y);

         for(int i=;i<=n;i++)

         for(int j=i+;j<=n;j++)

             if(sqrt(sqr(p[i].x-p[j].x)+sqr(p[i].y-p[j].y))<=r){//距离不大于r

                 int ok=;

                 for(int k=;k<=n;k++)

                     if(k!=i&&k!=j&&same(p[i],p[k],p[j]))

                         ok=;

                 if(ok){//构造Kirchhoff矩阵

                     mat[i][j]=mat[j][i]=-;

                     mat[i][i]++;mat[j][j]++;

                 }

             }

         int ans=det(mat,n-);

         printf("%d\n",ans?ans:-);

     }

 }