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

public class CommonSubsequence
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int testCase = sc.nextInt();
        boolean flag = false;
        int position = 0;
        while(testCase-- > 0)
        {
            int sizeOfArrayOne = sc.nextInt();
            int arrayOne[] = new int[1001];
            for(int i = 0; i < sizeOfArrayOne; i++)
            {
                arrayOne[sc.nextInt()]++;
            }
            for(int i = 0; i < sizeOfArrayOne; i++)
            {
                int arrayTwoValue = sc.nextInt();
                if(arrayOne[arrayTwoValue] > 0 && position == 0)
                {
                    flag = true;
                    position = i;
                    break;
                }
            }
            if(flag)
            {
                System.out.println("YES");
                System.out.println("1 " + position);
            }
        }
    }
}