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 n, m, x, flag, ans;
    map<int, int> ma;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
      cin >> x;
      ma[x]++;
    }
    for (int i = 0; i < m; i++) {
      cin >> x;
      if (flag == 1) continue;
      if (ma[x] == 1) {
        ans = x;
        flag = 1;
      }
    }
    if (flag == 0)
      cout << "N0\n";
    else {
      cout << "YES\n"
           << "1 " << ans << "\n";
    }
    flag = 0;
  }
}
