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 a[1050], b[1050];
set<int> brojevi;
int main() {
  int t, n, m;
  cin >> t;
  for (int i = 0; i < t; i++) {
    cin >> n >> m;
    for (int j = 0; j < n; j++) {
      cin >> a[j];
      auto pos = brojevi.find(a[j]);
      if (pos == brojevi.end()) {
        brojevi.insert(a[j]);
      }
    }
    int c = -1;
    for (int j = 0; j < m; j++) {
      cin >> b[j];
    }
    for (int j = 0; j < m; j++) {
      auto pos = brojevi.find(b[j]);
      if (pos != brojevi.end()) {
        c = b[j];
        break;
      }
    }
    if (c == -1) {
      cout << "NO" << endl;
      continue;
    }
    cout << "YES" << endl;
    cout << 1 << " " << c << endl;
    brojevi.clear();
  }
  return 0;
}
