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 main() {
  int t, n, m, p, q, i;
  vector<int> a, b, c(1001);
  cin >> t;
  while (t--) {
    cin >> n >> m;
    for (i = 0; i < n; i++) {
      cin >> p;
      a.push_back(p);
    }
    for (i = 0; i < m; i++) {
      cin >> p;
      b.push_back(p);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    auto it =
        set_intersection(a.begin(), a.end(), b.begin(), b.end(), c.begin());
    c.resize(it - c.begin());
    if (c.size() == 0) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
      cout << "1 " << c[0] << endl;
    }
    a.clear();
    b.clear();
    c.clear();
  }
}
