#include<iostream>
#include<algorithm>
#define M 1000000
using namespace std;
int jack[M],jill,both[M];
int main()
{
int i,j,k,m,n,l;
//freopen("in.txt","r",stdin);
while(scanf("%d%d",&n,&m)&&(m||n))
{
k=l=0;
for(i=0;i<n;i++)
scanf("%d",&jack[i]);
sort(jack,jack+n);
for(i=0;i<m;i++)
{
scanf("%d",&jill);
if(binary_search(jack, jack + n, jill))
k++;
}
printf("%d\n",k);
}
return 0;
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.