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 main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d%d", &n, &m);
    vector<int> A(10001, 0);
    vector<int> B(10001, 0);
    int x;
    for (int i = 0; i < n; i++) {
      scanf("%d", &x);
      A[x]++;
    }
    for (int i = 0; i < m; i++) {
      scanf("%d", &x);
      B[x]++;
    }
    int flag = 1;
    for (int i = 0; i < 10001; i++)
      if (A[i] && B[i]) {
        printf("YES\n1 %d\n", i);
        flag = 0;
        break;
      }
    if (flag) printf("NO\n");
  }
}
