int inset(int b[],int m,int t)
{
     int i,flag=0;
     for(i=0; i<m; i++)
     {
         if(b[i]==t)
         {
             flag=1;
             break;
             }
        }
        return flag;
}

int cmp(const void *a,const void *b)
{
     return (*(int*)a-*(int*)b);
}

int main()
{
  int n,m;
  while((scanf("%d%d",&n,&m)!=EOF)&&n*n+m*m!=0)
  {
     int a[N],b[N],min,i,j=0,count=0;
     int s[N];
     for(i=0; i<n; i++)
     {
         scanf("%d",&a[i]);
         }
         for(i=0; i<m; i++)
         {
             scanf("%d",&b[i]);
             }
             min=a[0];
             for(i=1; i<n; i++)
             {
                 if(a[i]<min)
                 {
                     min=a[i];
                     }
                }
                min--;
             for(i=0; i<n; i++)
             {
                 if(inset(b,m,a[i]))
                 {
                     a[i]=min;
                     count++;
                     }
                }
                if(count==n)
                {
                     printf("NULL");
                }
                else
                {
                     for(i=0; i<n; i++)
                     {
                         if(a[i]!=min)
                         {
                             s[j++]=a[i];
                             }
                        }
                        qsort(s,j,sizeof(s[0]),cmp);
                        for(i=0; i<j; i++)
                        {
                             printf("%d ",s[i]);
                        }
                     
                }
                printf("\n");
     }
     return 0;