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 x, y;
    int flag = 0;
    cin >> x >> y;
    int a;
    vector<int> b(y);
    set<int> s;
    for (int i = 0; i < x; i++) {
      cin >> a;
      s.insert(a);
    }
    for (int j = 0; j < y; j++) {
      cin >> b[j];
    }
    for (int i = 0; i < y; i++) {
      if (s.find(b[i]) != s.end()) {
        cout << "YES" << endl;
        cout << 1 << " " << b[i] << endl;
        flag = 1;
        break;
      }
    }
    if (flag == 0) {
      cout << "NO" << endl;
    }
  }
  return 0;
}
