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> ma;
  for (long long i = 0; i < n; i++) {
    int t;
    cin >> t;
    ma[t] = 1;
  }
  int ans = 0;
  int flag = 0;
  for (long long i = 0; i < m; i++) {
    int t;
    cin >> t;
    if (flag) continue;
    if (ma.count(t)) {
      ans = t;
    }
  }
  if (flag) {
    cout << "YES" << endl;
    cout << 1 << " " << ans << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int T_ = 1;
  cin >> T_;
  for (int i = 0; i < T_; i++) solve();
  return 0;
}
