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;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<int> a, b;
    multiset<int> sa;
    int ain, bin;
    for (int i = 0; i < n; i++) {
      cin >> ain;
      a.push_back(ain);
      sa.insert(ain);
    }
    int flag = 0, ans = 0;
    for (int i = 0; i < m; i++) {
      cin >> bin;
      b.push_back(bin);
      if (sa.find(bin) != sa.end()) {
        flag = 1;
        ans = bin;
      }
    }
    if (flag) {
      cout << "YES" << endl;
      cout << "1"
           << " " << ans << endl;
    } else {
      cout << "NO";
    }
  }
  return 0;
}
