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 K
{
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        int n=sc.nextInt();
        int m=sc.nextInt();
        ArrayList<Integer>al=new ArrayList<>();
        int a[]=new int[n];
        int b[]=new int[m];
        for(int i=0;i<n;i++)
        {
            a[i]=sc.nextInt();
            al.add(a[i]);
        }
        int f=0;
        for(int i=0;i<m;i++)
        {
            b[i]=sc.nextInt();
           if(al.contains(b[i]))
           {
               System.out.println("YES");
               f=1;
               System.out.println("1"+" "+b[i]);
               break;
           }
        }
        if(f==0)
        {
            System.out.println("NO");
        }
        
    }
}