http://acm.hdu.edu.cn/showproblem.php?pid=3763
傻逼题没什么好说的
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
const int MAXN=1000010;
using namespace std;
int a[MAXN];
int main()
{
int x,n,m;
while(scanf("%d%d",&n,&m)==2){
if(n==0&&m==0) break;
for(int i=1;i<=m;++i) scanf("%d",&a[i]);
int ans=0;
while(m--){
scanf("%d",&x);
if(binary_search(a+1,a+n+1,x)) ans++;
}
printf("%d\n",ans);
}
return 0;
}