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 dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
void solve() {
  long long int n, m;
  cin >> n >> m;
  map<long long int, long long int> um1, um2;
  for (int i = 0; i < (n); ++i) {
    long long int num;
    cin >> num;
    um1[num]++;
  }
  for (int i = 0; i < (m); ++i) {
    long long int num;
    cin >> num;
    um2[num]++;
  }
  for (auto it : um1) {
    if (um2[it.first] > 0) {
      cout << "YES" << '\n';
      cout << 1 << " ";
      cout << it.first << '\n';
      return;
    }
  }
  cout << "NO" << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
