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

//package CodeForces;

import java.util.HashMap;
import java.util.Scanner;

public class Subsequence {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int t=s.nextInt();
		while(t>0)
		{
			int n=s.nextInt();
			int m=s.nextInt();
			int arr1[]=new int[n];
			int arr2[]=new int[m];
			HashMap<Integer,Boolean> map=new HashMap<>();
			for(int i=0;i<n;i++)
			{
				arr1[i]=s.nextInt();
				map.put(arr1[i],true);
			}
			int ans=-1;
			for(int i=0;i<m;i++)
			{
				arr2[i]=s.nextInt();
				if(map.containsKey(arr2[i]))
				{
					ans=arr2[i];
				}
			}
			
			if(ans!=-1)
			{
				System.out.println("YES");
				System.out.println(1+" "+ans);
			}
			else
			{
				System.out.println("NO");
			}
			
			t--;
		}

	}

}
