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