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;
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
int main() {
  {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  };
  int m, n, t, tt;
  cin >> t;
  while (t--) {
    set<int> as;
    vector<int> b;
    int res = -1;
    cin >> m >> n;
    b.resize(n);
    for (int i = 0; i < m; i++) {
      cin >> tt;
      as.insert(tt);
    }
    for (int i = 0; i < n; i++) {
      cin >> tt;
      if (as.find(tt) != as.end()) res = tt;
    }
    if (res != -1) {
      cout << "YES" << endl;
      cout << 1 << " " << res << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
