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.Scanner;

public class TaskA {
    private static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        int t = sc.nextInt();
        while (t-- > 0) {
            solve();
        }
    }

    private static void solve() {
        int n = sc.nextInt(), m = sc.nextInt();
        int[] cnt = new int[1001];
        for (int i = 0; i < n; i++)
            cnt[sc.nextInt()]++;
        int ans = 0;
        for (int i = 0; i < m; i++) {
            int x = sc.nextInt();
            if (ans == 0 && cnt[x] > 0)
                ans = x;
        }
        if (ans > 0)
            System.out.println("YES\n1 " + ans);
        else
            System.out.println("NO");
    }
}
