rt

#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int T,n,m,a[100005],b[100005],x ;
bool flag;
signed main()
{
    scanf("%lld",&T);
    while (T--)
    {
        flag = false;
        x = 0;
        scanf("%lld%lld",&n,&m);
        for (int i = 1; i <= n; i++)
        {
            scanf("%lld",&a[i]);
            if (a[i] == 1) i--,n--;
        }
        sort(a + 1,a + n + 1);
        for (int i = 1; i <= m; i++)
        {
            scanf("%lld",&b[i]);
            if(b[i] == 1) i--,m--;
        }
        sort(b + 1,b + m + 1);
        if (n - m > 1 || n - m == 0)
        {
            printf("NO\n");
            continue;
        }
        for (int i = 1; i <= n; i++)
        {
            if (a[i] != b[i])
            {
                x = a[i];
                break;
            }
        }
        if (!x)
        {
            printf("NO\n");
            continue;
        }
        for(int i = 2;i * i <= x;i++)
        {
            if(x % i == 0)
            {
                flag = true;
                printf("NO\n");
                break;
            }
        }
        if(!flag) printf("YES\n");
    }
    return 0;
}