myJavaCode

package myjavacodes;

import java.util.Arrays;
import java.util.Scanner;


public class javaTpoint
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int t;
        t = sc.nextInt();
        int n, m, idx = 0;
        boolean b;

        for (int i = 0; i < t; i++) {
            n = sc.nextInt();
            m = sc.nextInt();
            int[] ara1;
            int[] ara2;
            ara1 = new int[n];
            ara2 = new int[m];
            for (int j = 0; j < n; j++) {
                ara1[j] = sc.nextInt();
            }
            for (int j = 0; j < m; j++) {
                ara2[j] = sc.nextInt();
            }
            Arrays.sort(ara1);
            Arrays.sort(ara2);
            b = false;
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < m; k++) {
                    if(ara1[j] == ara2[k]) {
                        b = true;
                        idx = j;
                        break;
                    }
                }
                if(b) break;
            }
            if(b) {
                System.out.println("YES");
                System.out.println("1 " + ara1[idx]);
            }
            else System.out.println("NO");
        }
    }
}