1
2 2
1 1
1 2
 1
1 3
3
1 2 3
 1
1 1
1000
1000
 1
2 2
2 2
2 2
 5
4 5
10 8 6 4
1 2 3 4 5
1 1
3
3
1 1
3
2
5 3
1000 2 2 2 3
3 1 5
5 5
1 2 3 4 5
1 2 3 4 5
 1
4 4
1 1 1 1
1 2 3 4
 1
2 3
1 1
1 2 3

YES
1 1
 YES
1 3
 YES
1 1000
 YES
1 2
 YES
1 4
YES
1 3
NO
YES
1 3
YES
1 1
 YES
1 1
 YES
1 1

#include<bits/stdc++.h>
using namespace std;
int32_t main()
{
   int t;
    cin>>t; 
    while(t--);
    {
      int n,m;
    cin>>n>>m;
    int a[n]={0};
    int b[m]={0};
    map<int,int>Q;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        Q[a[i]]++;
    }
    int flag = 0;
    for(int i=0;i<m;i++)
    cin>>b[i];
    for(int i=0;i<m;i++)
    {
        if(Q.count(b[i])!=0)
        {
            cout<<"YES\n";
            cout<<"1"<<b[i]<<"\n";
            flag=1;
            break;
            
        }
    }
    if(flag==0)
    cout<<"NO\n";
    }
    return 0;
}
