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() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, m;
    cin >> n >> m;
    long long int A[n], B[m];
    for (long long int i = 0; i < n; i++) {
      cin >> A[i];
    }
    for (long long int i = 0; i < m; i++) {
      cin >> B[i];
    }
    long long int flag = 0, num = 0, temp = 0;
    for (long long int i = 0; i < n; i++) {
      flag = 0;
      temp = A[i];
      for (long long int j = 0; j < m; j++) {
        if (temp == B[j]) {
          num = temp;
          flag = 1;
          break;
        }
      }
    }
    if (flag == 1) {
      cout << "YES\n1 " << num << "\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
