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() {
  long long int i, j, k, n, m;
  cin >> n >> m;
  vector<long long int> a(n), b(m);
  for (auto &i : a) cin >> i;
  ;
  for (auto &i : b) cin >> i;
  ;
  map<long long int, long long int> m2;
  for (i = 0; i < n; i++) m2[a[i]]++;
  for (i = 0; i < m; i++) {
    if (m2[b[i]]) {
      cout << "YES\n";
      cout << 1 << " " << b[i] << '\n';
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
