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;
int mod = 1e9 + 7;
int p[300100];
int main() {
  int t, i, n, m, x, num, f;
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &m);
    f = 0;
    num = 0;
    for (i = 1; i <= n; i++) {
      scanf("%d", &x);
      p[x]++;
    }
    for (i = 1; i <= m; i++) {
      scanf("%d", &x);
      if (p[x]) {
        f = 1;
        num = x;
      }
    }
    if (f == 1) {
      printf("YES\n");
      printf("1 %d\n", num);
    } else {
      printf("NO\n");
    }
  }
}
