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 q, n, m, res;
int a[5000], b[5000];
map<int, int> mp;
int main() {
  cin >> q;
  while (q--) {
    cin >> n >> m;
    res = -1;
    for (int i = 1; i <= n; i++) cin >> a[i], mp[a[i]]++;
    for (int i = 1; i <= m; i++) {
      cin >> b[i];
      mp[b[i]]++;
      if (mp[b[i]] >= 2) res = b[i];
    }
    mp.clear();
    if (res == -1)
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      cout << 1 << ' ' << res << endl;
    }
  }
}
