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

public class subsequence {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        boolean x=false;
        Set<Integer> s=new HashSet<>();
        while(t-->0){
            int n=sc.nextInt();
            int m=sc.nextInt();
            while(n-->0){
                int a=sc.nextInt();
                s.add(a);
            }
            int ans=0;
            while(m-->0) {
                int p=sc.nextInt();
                if(s.contains(p)==true){
                    x=true;
                     ans=p;
                }
            }
            if(x==true && s.contains(ans)==true){
                System.out.println("YES");
                System.out.println(1+" "+ans);
            }
            else {
                System.out.println("NO");
            }

        }
    }
}