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(nullptr);
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<int> nums(1001);
    vector<int> f(1001);
    for (int i = 0; i < n; ++i) {
      int tmp;
      cin >> tmp;
      nums[tmp]++;
      f[tmp] = 0;
    }
    for (int i = 0; i < m; ++i) {
      int tmp;
      cin >> tmp;
      nums[tmp]++;
      f[tmp] = 1;
    }
    vector<int> ans;
    for (int i = 1; i <= 1000; ++i) {
      if (nums[i] == 2) {
        ans.push_back(i);
        break;
      }
    }
    if (ans.size() == 0)
      cout << "NO\n";
    else {
      cout << "YES\n";
      cout << 1 << " " << ans[0] << '\n';
    }
  }
}
