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 A_CommonSubSequence{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        HashSet<Integer> hs = new HashSet<>();
        int t = in.nextInt();
        while(t-->0){
            int m = in.nextInt();
            int n = in.nextInt();
            for(int i=0;i<m;i++){
                int val = in.nextInt();
                hs.add(val);
            }
            int s[] = new int[n];
            for(int i=0;i<n;i++){
                s[i] = in.nextInt();
            }
            int f = 0;
            for(int i=0;i<s.length;i++){
                if(hs.contains(s[i])){
                    System.out.println("YES \n"+1+" "+s[i]);
                    f=1;
                    break;
                }
            
            
            }
if(f==0)
                 System.out.println("NO");
        }
        in.close();

    }
}