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 CommonSubsequence {

	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		for(int i = 0; i < T; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			int temp = st.countTokens();
			int arr[] = new int[temp];
			for(int j = 0; j < temp; j++) {
				arr[j] = Integer.parseInt(st.nextToken());
			}
			st = new StringTokenizer(br.readLine());
			temp = st.countTokens();
			int arr2[] = new int[temp];
			for(int j = 0; j < temp; j++) {
				arr2[j] = Integer.parseInt(st.nextToken());
			}
			boolean found = false;
			for(int j = 0; j < arr.length; j++) {
				for(int k = 0; k < arr2.length; k++) {
					if(arr[j] == arr2[k]) {
						found = true;
						System.out.println("YES");
						System.out.println("1 " + arr[j]);
						break;
					}
				}
				if(found) {
					break;
				}
			}
			if(!found) {
				System.out.println("NO");
			}
		}
	}

}
