import java.util.*;
class Main {
public int solution(int N, int M, int[][] input) {
int answer = 0;
int[][] array = new int[N + 1][N + 1];
for (int i = 0; i < M; i++) {
for (int j = 1; j < N; j++) {
for (int k = 0; k < j; k++) {
array[input[i][j]][input[i][k]] = 1;
}
}
}
for (int i = 1; i < N + 1; i++) {
for (int j = 1; j < N + 1; j++) {
if (i != j && array[i][j] == 0)
answer++;
}
}
return answer;
}
public static void main(String[] args) {
Main T = new Main();
Scanner kb = new Scanner(System.in);
int N = kb.nextInt();
int M = kb.nextInt();
int[][] input = new int[M][N];
for (int i = 0; i < M; i++)
for (int j = 0; j < N; j++)
input[i][j] = kb.nextInt();
System.out.print(T.solution(N, M, input));
}
}
댓글