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() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n, m, a;
    cin >> n >> m;
    set<long long> s;
    for (long long i = 0; i < n; i++) {
      cin >> a;
      s.insert(a);
    }
    long long f = -1;
    for (long long i = 0; i < m; i++) {
      cin >> a;
      if (s.find(a) != s.end()) {
        f = a;
      }
    }
    if (f == -1)
      cout << "NO"
           << "\n";
    else {
      cout << "YES"
           << "\n"
           << 1 << " " << f << "\n";
    }
  }
  return 0;
}
