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, i, j, n, m;
  cin >> t;
  while (t--) {
    int flag = 0;
    cin >> n >> m;
    int a[n];
    int b[m];
    int p[1001] = {0};
    int q[1001] = {0};
    for (i = 0; i < n; i++) {
      cin >> a[i];
      p[a[i]]++;
    }
    for (i = 0; i < m; i++) {
      cin >> b[i];
      q[b[i]]++;
    }
    for (i = 0; i <= 1000; i++) {
      if (q[i] >= 1 && p[i] >= 1) {
        cout << "YES" << endl;
        cout << "1"
             << " " << i << endl;
        flag = 1;
        break;
      }
    }
    if (!flag) {
      cout << "NO" << endl;
    }
  }
}
