import java.util.*;
public class Main {

	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d = sc.nextInt();
		int arr[][] = new int[n][d];
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<d;j++)
			{
				arr[i][j] = sc.nextInt();
			}
		}
		int count=0;
		double dist = 0;
		for(int i=0;i<n-1;i++)
		{
			for(int j = i+1;j<n;j++)
			{
				for(int k = 0;k<d;k++)
				{
					dist += (double)(Math.pow(arr[i][k]- arr[j][k],2));
				}
				dist = (double)Math.sqrt(dist);
				//System.out.println(dist);
				double ans = Math.ceil(dist);
				
				if(ans == dist)
					count++;
				dist=0;
			}
		}
		System.out.println(count);
		sc.close();
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz