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::sync_with_stdio(false);
  cin.tie(0);
  int T = 1;
  cin >> T;
  while (T--) {
    int n, m, te, f = 0, ans;
    cin >> n >> m;
    map<int, int> ma;
    for (int i = 0; i < n; i++) {
      cin >> te;
      if (ma[te] == 0 || ma[te] == 1) ma[te]++;
    }
    for (int i = 0; i < m; i++) {
      cin >> te;
      ma[te]++;
      if (ma[te] == 2 && !f) {
        f = 1;
        ans = te;
      }
    }
    if (f) {
      cout << "YES\n1 " << ans << "\n";
    } else
      cout << "NO\n";
  }
  return 0;
}
