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