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 Solution {
	
	public static void main(String[] args) {
			Scanner sc = new Scanner(System.in);
			int t =sc.nextInt();
			while(t-->0) {
				int n1=sc.nextInt();
				int n2=sc.nextInt();
				int[] arr1 = new int[n1];
				int[] arr2 = new int[n2];
				for(int i=0;i<n1;i++) {
					arr1[i]=sc.nextInt();
				}
				for(int i=0;i<n2;i++) {
					arr2[i]=sc.nextInt();
				}
				int ans=0,flag=0;
				for(int i=0;i<n1;i++) {
					for(int j=0;j<n2;j++) {
						if(arr1[i]==arr2[j]) {
							ans=arr1[i];
							flag=1;
						}
						break;
					}
				}
				if(flag==1) {
					System.out.println("YES");
					System.out.println("1"+" "+ans);
				}else System.out.println("NO");
				
			}
			sc.close();
	}
}

