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

import java.util.*;
public class div2_695 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long t = in.nextLong();
		while(t-->0)
			
		{
			int n = in.nextInt();
			int a[] = new int[n];
			int m = in.nextInt();
			int b[] = new int[m];
			for(int i=0 ; i<n ; i++) a[i] = in.nextInt();
			for(int i=0 ; i<m ; i++) b[i] = in.nextInt();
			int flag=0,ans=-1;
			for(int i=0 ; i<n ; i++)
			{
			    for(int j=0 ; j<m ; j++)
			    {
			        if(i!=j && a[i]==b[j])
			        {
			            flag=1;
			            ans = a[i];
			            break;
			        }
			    }
			    if(flag==1) break;
			}
			if(flag==1) 
			{
			    System.out.println("YES");
			    System.out.println("1 "+ans);
			}
			else
			    System.out.println("NO");
		}
		
	}

}