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;
const int N = 1e3 + 5;
int main() {
  long long tst;
  cin >> tst;
  while (tst--) {
    long long n, m;
    cin >> n >> m;
    map<long long, long long> was;
    for (long long i = 0; i < n; i++) {
      long long x;
      cin >> x;
      was[x] = 1;
    }
    bool ok = true;
    long long ans;
    for (long long i = 0; i < m; i++) {
      long long x;
      cin >> x;
      if (was[x] && ok) {
        ok = false;
        ans = x;
      }
    }
    if (ok)
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      cout << 1 << ' ' << ans << endl;
    }
  }
}
