#include <stdio.h>

void solve()
{
    int n, m,i,j, arr[100010], brr[100010];
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
    scanf("%d",&m);
    for (int j = 0; j < m; j++)
    {
        scanf("%d", &brr[j]);
    }
   
    int k=0;
  

for (int i = 0; i < n; i++)
{
    int found = 0;

    for (int j = 0; j < m; j++)
    {
        if (arr[i] == brr[j])
        {
            found = 1;
            break;
        }
    }

    if (found == 0)
    {
        arr[k] = arr[i];
        k++;
    }
}
    for (int i = 0; i < k ; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main()
{
    int i, t = 1;
    scanf("%d", &t);
    for (i = 0; i < t; i++)
        solve();
    return 0;
}