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 Program {
    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        int t = input.nextInt();

        for(int i=0; i<t; i++) {
            int n = input.nextInt();
            int m = input.nextInt();

            Set<Integer> setA = new HashSet<>();
            Set<Integer> setB = new HashSet<>();

            for(int j=0; j<n; j++) {
                setA.add(input.nextInt());
            }

            for(int j=0; j<m; j++) {
                setB.add(input.nextInt());
            }

            setA.retainAll(setB);
            if(setA.size() == 0)
                System.out.println("NO");
            else{
                System.out.println("YES");
                for(Integer num : setA) {
                    System.out.print(num + " ");
                    break;
                }
                System.out.println();
            }
        }
    }
}
