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 QA
{
	public static void main(String args[])
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t>0)
		{
			int n = sc.nextInt();
			int m = sc.nextInt();
			int ans = -1;
			ArrayList<Integer> a = new ArrayList<Integer>();
			ArrayList<Integer> b = new ArrayList<Integer>();
			for(int i=0;i<n;i++)
			{
				int x = sc.nextInt();
				a.add(x);
			}
			for(int i=0;i<m;i++)
			{
				int x = sc.nextInt();
				b.add(x);
			}
			if(n<=m)
			{
				for(int i=0;i<n;i++)
				{
					if(b.indexOf(a.get(i))>=0)
					{
						ans = a.get(i);
						System.out.println("YES");
						System.out.println("1 "+ans);
						break;
					}
				}
			}
			else
			{
				for(int i=0;i<m;i++)
				{
					if(a.indexOf(b.get(i))>=0)
					{
						ans = b.get(i);
						System.out.println("YES");
						System.out.println("1 "+ans);
						break;
					}
				}
			}
			if(ans==-1)
				System.out.println("NO");
			t--;
		}
	}
}