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 q;
  cin >> q;
  while (q--) {
    int n, m, t;
    bool f = false;
    cin >> n >> m;
    unordered_set<int> sn;
    for (int i = 0; i < n; i++) {
      cin >> t;
      sn.insert(t);
    }
    for (int i = 0; i < m; i++) {
      cin >> t;
      if (sn.find(t) != sn.end()) {
        f = true;
        break;
      }
    }
    if (f) {
      cout << "YES\n";
      cout << "1 " << t << "\n";
    } else
      cout << "NO\n";
    sn.clear();
  }
  return 0;
}
