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.HashSet;
import java.util.Scanner;

public class commonSub {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();
		
		for(int t = 0; t < cases ; t++)
		{
			HashSet<Integer> hSet = new HashSet<Integer>();
			int n = in.nextInt();
			int m = in.nextInt();
			boolean flag = false;
			for(int i = 0; i < n; i++)
			{
				hSet.add(in.nextInt());
			}
			
			for(int i = 0; i < m; i++)
			{
				int b = in.nextInt();
				if(hSet.contains(b))
				{
					
					System.out.println("YES");
					System.out.println(1 + " "+ b);
					flag = true;
					break;
				}
			}
			if(!flag)
				System.out.println("NO");
		}

	}

}
