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