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 tests(void);
int tests() {
  int n, m;
  vector<int> v;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    int in;
    cin >> in;
    v.push_back(in);
  }
  for (int i = 0; i < m; i++) {
    int in;
    cin >> in;
    v.push_back(in);
  }
  sort(v.begin(), v.end());
  for (int i = 1; i < v.size(); i++) {
    if (v[i - 1] == v[i]) {
      cout << "YES"
           << "\n";
      cout << '1' << " " << v[i] << "\n";
      return 0;
    }
  }
  cout << "NO"
       << "\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int test;
  cin >> test;
  while (test--) {
    tests();
  }
  return 0;
}
