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;
    cin >> n >> m;
    int arr1[n], arr2[m];
    for (int i = 1; i <= n; i++) {
      cin >> arr1[i];
    }
    for (int i = 1; i <= m; i++) {
      cin >> arr2[i];
    }
    vector<int> v;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (arr1[i] == arr2[j]) {
          v.push_back(arr1[i]);
        }
      }
    }
    int x = v.size();
    cout << x << endl;
    if (x != 0) {
      int ans = 1;
      cout << "YES" << endl;
      cout << ans << " " << v.front() << endl;
    } else
      cout << "NO" << endl;
  }
}
