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

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;
public class Codechef
{
    public static void main (String[] args) throws java.lang.Exception
    {
        Scanner sc = new Scanner(System.in);
        if(!(sc.hasNext()))
            return;
        int T = sc.nextInt();
        while(T-- > 0) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int l =0,last=0;
            int [] a = new int [n];
            int [] b = new int[m];
            for(int i = 0; i<n ; i++ ){
                a[i] = sc.nextInt();
            }
            for(int i = 0; i<m ; i++ ){
                b[i] = sc.nextInt();
            }
            int [] c = new int[n];
            for(int i = 0; i<n ; i++){
                for(int j = last; j<m ; j++){
                    if(a[i] == b[j]){
                        last =j;
                        c[l]=a[i];
                        l++;
                    }
                }
            }
            if(l>0)
                System.out.println("YES");
            else {
                System.out.println("NO");
                continue;
            }
            if(l == m || l==n){
                System.out.print("1 ");
                System.out.println(a[0]);
                continue;
            }
            System.out.print(l + " ");
            for(int i=0;i<l ;i++){
                System.out.print(c[i] + " ");
            }
            System.out.println();
        }
    }
}
