// Code By : d:3:m:o:r:a:l:1:z:e:r
#include <bits/stdc++.h>
using namespace std;
// sum(n^2) = n(n+1)(2n+1)/6
// GP - (bk-a)/k-1
// Faulhaber’s formula
typedef long long ll;
typedef long double lld;
typedef vector < int > vi;
typedef pair < int, int > pi;
const ll template_array_size = 1e6;
ll a[template_array_size];
ll b[template_array_size];
ll c[template_array_size];
ll mod = 1e9 + 7;
string s, t;
ll ans = 0;
// map<char,int> mpp;
#define F first
#define S second
#define PB push_back
#define nl '\n'
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define SQ(a)(a) * (a)
#define VECTOR_INT(vec_name, size) \
vector < ll > vec_name(size); \
for (int i = 0; i < size; ++i) { \
cin >> vec_name[i]; \
}
#define VECTOR_INT_AND_HASH(vec_name, size) \
vector < int > vec_name(size); \
map < int, int > mpp; \
for (int i = 0; i < size; ++i) { \
cin >> vec_name[i]; \
mpp[vec_name[i]]++; \
}
#define VECTOR_PRINT(vec_name) \
for (int i = 0; i < vec_name.size(); ++i) { \
cout << vec_name[i] << " "; \
}
int sum(vector < int > numbers) {
return accumulate(numbers.begin(), numbers.end(), 0);
}
int findGcd(int a, int b) {
while (a > 0 && b > 0) {
if (a > b) a = a % b;
else b = b % a;
}
if (a == 0) return b;
return a;
}
vector < vector < int >> adj;
map < int, int > mpp;
int cnt = 0;
int solve(int n, int m, vector < int > v, vector < vector < int >> rec) {
for (int i = 0; i < n-1; i++) {
for (int j = 0; j < m; j++) {
mpp[rec[j][i]]++;
if (mpp[rec[j][i]] == m) {
// cout<<"erased: "<<rec[j][i]<<"count being: "<<mpp[rec[j][i]]<<nl;
mpp.erase(rec[j][i]);
if(mpp.size()==0)cnt++;
}
}
}
return cnt;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
// int tt; cin>>tt;
// while(tt--){
cout<<solve(3, 1, {-1, 0, 0}, {{1, 2}});
// cout << solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}});
// }
return 0;
}
