#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M && N > 0 && M > 0) {
unordered_set<int> cd;
for(int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
cd.insert(tmp);
}
int count = 0;
for(int i = 0; i < M; i++) {
int tmp;
cin >> tmp;
if(cd.find(tmp) != cd.end())
count++;
}
cout << count << endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBOLCBNOwoJd2hpbGUoY2luID4+IE4gPj4gTSAmJiBOID4gMCAmJiBNID4gMCkgewoJCXVub3JkZXJlZF9zZXQ8aW50PiBjZDsKCQlmb3IoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSB7CgkJCWludCB0bXA7CgkJCWNpbiA+PiB0bXA7CgkJCWNkLmluc2VydCh0bXApOwoJCX0KCQlpbnQgY291bnQgPSAwOwoJCWZvcihpbnQgaSA9IDA7IGkgPCBNOyBpKyspIHsKCQkJaW50IHRtcDsKCQkJY2luID4+IHRtcDsKCQkJaWYoY2QuZmluZCh0bXApICE9IGNkLmVuZCgpKQoJCQkJY291bnQrKzsKCQl9CgkJY291dCA8PCBjb3VudCA8PCBlbmRsOwoJfQoJcmV0dXJuIDA7Cn0=