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

#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, array1[1000], array2[1000], freq1[1000] = {0}, freq2[1000] = {0}, m,
                                       i;
    scanf("%d %d", &n, &m);
    for (i = 0; i < n; ++i) {
      scanf("%d", &array1[i]);
      freq1[array1[i]]++;
    }
    for (i = 0; i < m; ++i) {
      scanf("%d", &array2[i]);
      freq2[array2[i]]++;
    }
    int flag = 0;
    for (i = 0; i < 1000; ++i) {
      if (freq1[i] & freq2[i]) {
        flag = 1;
        printf("YES\n");
        printf("1 %d\n", i);
        break;
      }
    }
    if (!flag) {
      printf("NO\n");
    }
  }
  return 0;
}
