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

public class CommonSubSeq {
    public static Scanner sc = new Scanner(System.in);
    
    static void solve(){
      int n = sc.nextInt();
      int m = sc.nextInt();
      List<Integer> A = new ArrayList<>();
      List<Integer> B = new ArrayList<>();
      for(int i = 0;i<n;i++){
          A.add(sc.nextInt());
      }
      for(int i = 0;i<m;i++){
        B.add(sc.nextInt());
    }
    int a = 1; int b = 0;boolean found = false;
    for(int var : B){
        if(var == 1)
            continue;
        else if(A.contains(var)){
            b = var;
            found = true;           
            break;
        }
    }    
        if(b == 0 && found == false){
                System.out.println("NO");
        } else{
            System.out.println("YES");
            System.out.println(a+" "+b);
        }
    }
    
    public static void main(String[] args) {
        int test = sc.nextInt();
        while(test --> 0){
            solve();
        }
    }
}