#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<fstream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
fstream in,out;
int cmp(vector<int>& a ,vector<int>& b){
int i;
int flag=1;
for(i=0;i<33&& flag==1;i++){
	if(a[i]!=b[i]){
		flag=0;
	}
}
return flag;
}

int main(){
	in.open("input.txt",ios::in);
	out.open("output.txt",ios::out);
	int s,t,q,i,j,value,cont=0;
	bool flag,found;
	in>>t>>s>>q;
	vector<vector<int> > tests(t);
	vector<int> answ(33);
	for(i=0;i<t;i++){
	tests[i].resize(33);
	}
	for(i=0;i<t;i++){
		for(j=0;j<33;j++){
			tests[i][j]=0;
		}
	}

	for(i=0;i<t;i++){
		for(j=0;j<q;j++){
		in>>value;
		tests[i][value]++;
		}
	}
	/*
for(i=0;i<tests.size();i++){
	for(j=0;j<tests[i].size();j++){
	cout<<tests[i][j]<<" ";
	}
	cout<<endl;
}
system("pause>nul");
*/
	sort(tests.begin(),tests.end());
/*
for(i=0;i<tests.size();i++){
	for(j=0;j<tests[i].size();j++){
	cout<<tests[i][j]<<" ";
	}
	cout<<endl;
}
system("pause>nul");
*/
	for(i=0;i<s;i++){
		for(j=0;j<=32;j++){
		answ[j]=0;
		}
		for(j=0;j<q;j++){
		in>>value;
		answ[value]++;
		}
		flag=true;
		found=false;
		for(j=0;j<t&&!found;j++){
			if( cmp(answ,tests[j]) ){
			found=true;
			}
		}
		j--;
		if(found){

		for(;j<t&&flag;j++){

		if( !cmp(answ,tests[j]) ){
		flag=false;
		}
		cont++;
		}
		cont--;
		}

	}
	out<<cont;
	in.close();
	out.close();
	return 0;
}