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>
int a[1005];
int b[1005];
int c[1005];
int main() {
  int t;
  int n, m;
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &m);
    memset(c, 0, sizeof(c));
    int ans = -1;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      c[a[i]]++;
      if (c[a[i]] >= 2) {
        ans = a[i];
      }
    }
    for (int i = 1; i <= m; i++) {
      scanf("%d", &b[i]);
      c[b[i]]++;
      if (c[b[i]] >= 2) {
        ans = b[i];
      }
    }
    if (ans == -1) {
      printf("NO\n");
      continue;
    }
    printf("YES\n1 %d\n", ans);
  }
}
