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;
void codeforces(int a[], int n, int b[], int m) {
  int dem[1000] = {0};
  for (int i = 0; i < n; i++) dem[a[i]]++;
  for (int i = 0; i < m; i++) dem[b[i]]++;
  for (int i = 0; i <= 1000; i++)
    if (dem[a[i]] == 2) {
      cout << "YES" << endl << "1 " << a[i] << endl;
      return;
    }
  cout << "NO" << endl;
}
int main() {
  int t;
  cin >> t;
  for (int ii = 0; ii < t; ii++) {
    int n, m;
    cin >> n >> m;
    int a[1001] = {0}, b[1001] = {0};
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    codeforces(a, n, b, m);
  }
  return 0;
}
