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.nextInt();
public class Solution {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int test_case = scanner.nextInt();
        
        for(int i = 0; i < test_case; ++i)
        {
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            
            int[] arrn = new int[n];
            int[] arrm = new int[m];
            for(int j = 0; j < n; ++j)
            {
                arrn[j] = scanner.nextInt();
            }
            for(int j = 0; j < m; ++j)
            {
                arrm[j] = scanner.nextInt();
            }
            
            boolean res = false;
            
            for(int j = 0; j < n; ++j)
            {
                for(int k = 0; k < m; ++k)
                {
                    if(arrn[j] == arrm[k])
                    {
                        res = true;
                        System.out.println("YES");
                        System.out.println(1 + " " + arrn[j]);
                        break;
                    }                  
                }
                if(res) break;
            }
            if(!res) System.out.println("NO");
        }
    }
}