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 main() {
  int n, m, i, h, t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d %d", &n, &m);
    int a[n + 1], b[n + 1], f = 0;
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    for (h = 0; h < m; h++) {
      scanf("%d", &b[h]);
      for (i = 0; i < n; i++) {
        if (a[i] == b[i]) {
          f = a[i];
        }
      }
    }
    if (f == 0) {
      printf("NO\n");
    } else {
      printf("YES\n1 %d\n", f);
    }
  }
  return 0;
}
