#include<cstdio>

#include<cmath>

#include<algorithm>

#include<cstring>

using namespace std;

const int N=;

int x[N],f[N],match[N],y[N],fi[N],num,ne[N],zz[N],n,m;

int dfs(int x)

{

    for (int i=fi[x];i;i=ne[i])

     if (!f[zz[i]])

      {

          f[zz[i]]=;

          if (!match[zz[i]]||dfs(match[zz[i]]))

           {

               match[zz[i]]=x;

               return ;

           }

      }

    return ;

}

void jb(int x,int y)

{

    ne[++num]=fi[x];

    fi[x]=num;

    zz[num]=y;

}

int main()

{

    while (~scanf("%d%d",&n,&m),n||m)

     {

         memset(fi,,sizeof fi);

         memset(match,,sizeof match);

         num=;

         for (int i=;i<=n;i++)scanf("%d%d",&x[i],&y[i]);

         for (int i=;i<=m;i++)scanf("%d%d",&x[i+n],&y[i+n]);

         for (int i=;i<=n;i++)

          for (int j=;j<=m;j++)

           if (x[i]==x[j+n]&&(y[i]==y[j+n]||y[i]==y[j+n]+)||

          x[i]+==x[j+n]&&(y[i]==y[j+n]||y[i]==y[j+n]+))jb(i,j);

        int ans=;

        for (int i=;i<=n;i++)

         {

             memset(f,,sizeof f);

             ans+=dfs(i);

         }

        printf("%d\n",n+m-ans);

     }

    return ;

}