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 Subsequence2
{
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for(int x=1;x<=t;x++)
		{
		    int m = sc.nextInt();
			int n = sc.nextInt();
			int[] a = new int[m];
			int[] b = new int[n];
			for(int i=0;i<m;i++)
			{
				a[i] = sc.nextInt();
			}
		    for(int i=0;i<n;i++)
			{
				b[i] = sc.nextInt();
			}
			Arrays.sort(a);
			Arrays.sort(b);
		    int count=0,res=0;
		    for(int i=0;i<m;i++)
			{
				for(int j=0;j<n;j++)
				{
					if(a[i]==b[j])
					{
						count += 1;
						res = a[i];	
					}
				}
			}
			System.out.println(count==0?"NO":"YES"+"\n"+"1 "+res);	
		}
	}
}