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.*;
import java.io.*;
public class Solution
{
    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();
            HashSet<Integer> set = new HashSet<>();
            boolean ptr = false;
            boolean check = true;
            for(int j = 0; j < n; j++)
            {
                int temp = input.nextInt();
                set.add(temp);
            }
            for(int p = 0; p < m; p++)
            {
                int temp = input.nextInt();
                if(set.contains(temp) && check)
                {
                    int a = 1;
                    System.out.println("YES");
                    System.out.print(a);
                    System.out.print(" ");
                    System.out.print(temp);
                    System.out.println();
                    ptr = true;
                    check = false;
                    break;
                }
            }
            if(!ptr)
            {
                System.out.println("NO");
            }
        }
    }
}