#include<cstdio>
#include<algorithm>
#include<vector>
const int N=2007,M=2e5+7;
typedef unsigned long long ull;
ull msk[65],val[N][N][4];int xs[N],ys[N],dst[N][N],p[N][N],rk[N][N];
bool np[M];int prime[M],pc;bool pds[N][N];
std::vector<int> vec[N];
int main()
{
	for(int k=0;k<64;++k)msk[k]=1ULL<<k;np[1]=1;
	for(int i=2;i<=2e5;++i)
	{
		if(!np[i])prime[++pc]=i;
		for(int j=1;j<=pc&&i*prime[j]<=2e5;++j){np[i*prime[j]]=1;if(!(i%prime[j]))break;}
	}
//	freopen("11.in","r",stdin);
//	freopen("today.in","r",stdin);
//	freopen("today.out","w",stdout);
	int n,m;ull ans=0;scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)scanf("%d%d",xs+i,ys+i);
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)
		{
			dst[i][j]=abs(xs[i]-xs[j])+abs(ys[i]-ys[j]);
			p[i][j]=j;if(j>i&&!np[dst[i][j]])vec[i].push_back(j);
		}
		std::swap(p[i][i],p[i][n]);
		std::sort(p[i]+1,p[i]+n,[=](int x,int y){
			if(dst[i][x]!=dst[i][y])
				return dst[i][x]<dst[i][y];
			int zx=std::min(i,x),zy=std::min(i,y);
			if(zx!=zy)return zx<zy;
			return (i^x^zx)<(i^y^zy);
		});
		for(int j=1;j<n;++j)rk[i][p[i][j]]=j;
	}
#define pc __builtin_popcountll
	for(int l=1;l<=n;l+=256)
	{
		int r=std::min(l+255,n);//printf("l=%d(r=%d)\n",l,r);
		for(int i=1;i<=n;++i)for(int j=1;j<n;++j)
		{
			val[i][j][0]=val[i][j-1][0];val[i][j][1]=val[i][j-1][1];
			val[i][j][2]=val[i][j-1][2];val[i][j][3]=val[i][j-1][3];
			if(l<=p[i][j]&&p[i][j]<=r)val[i][j][(p[i][j]-l)>>6]|=msk[(p[i][j]-l)&63];
//			printf("-[%d,%d]\n",i,j);
		}
		for(int i=1;i<=n;++i)for(int j:vec[i])
		{
			int x=rk[i][j],y=rk[j][i];
			ans+=pc((~val[i][x][0])&val[j][y-1][0])+pc((~val[j][y][0])&val[i][x-1][0]);
			ans+=pc((~val[i][x][1])&val[j][y-1][1])+pc((~val[j][y][1])&val[i][x-1][1]);
			ans+=pc((~val[i][x][2])&val[j][y-1][2])+pc((~val[j][y][2])&val[i][x-1][2]);
			ans+=pc((~val[i][x][3])&val[j][y-1][3])+pc((~val[j][y][3])&val[i][x-1][3]);
		}
		//printf("l=%d\n",l);
	}
	printf("%llu",ans);
	return 0;
}