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;
void solve() {
  int n, m;
  cin >> n >> m;
  map<int, int> a, b;
  int temp;
  for (long long i = 0; i < n; i++) {
    cin >> temp;
    a[temp]++;
  }
  for (long long i = 0; i < m; i++) {
    cin >> temp;
    b[temp]++;
  }
  auto itr = a.end();
  itr--;
  for (auto it = a.begin(); it != a.end(); it++) {
    if (b.find(it->first) != b.end()) {
      cout << "YES" << endl << "1 " << it->first << endl;
      return;
    } else if (it == itr) {
      cout << "NO" << endl;
      return;
    }
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  clock_t start = clock();
  long long test = 1;
  cin >> test;
  while (test--) solve();
  clock_t end = clock();
  cerr << fixed << setprecision(15) << ((double)(end - start)) / CLOCKS_PER_SEC
       << endl;
  return 0;
}
