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.io.*;
import java.util.*;
public class GFG {
	public static final void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        while(T>0){
            StringBuilder sb = new StringBuilder();
            int N = sc.nextInt();
            int M = sc.nextInt();
            HashMap<Integer,Integer> mp = new HashMap<Integer,Integer>();
            
            for(int i=0;i<N;i++){
                int val = sc.nextInt();
                System.out.println(val);
                mp.put(i,val);
            }
            
            
            for(int i=0;i<M;i++){
                int val = sc.nextInt();
                if(mp.containsValue(val)){
                    sb.append("Yes").append("\n").append("1 ").append(val);
                    break;
                }
            }
            
            if(sb.length()==0)
                sb.append("No");
                
            System.out.println(sb.toString());
            T--;
            
        }
    }
}