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 n, a, b;
  int s[1000];
  int d[1000];
  cin >> n;
  for (int v = 0; v < n; v++) {
    cin >> a >> b;
    for (int p = 0; p < a; p++) {
      cin >> s[p];
    }
    for (int t = 0; t < b; t++) {
      cin >> d[t];
    }
    int i, j;
    for (i = 0; i < a; i++) {
      for (j = 0; j < b; j++) {
        if (s[i] == d[j]) {
          cout << "YES" << endl;
          cout << "1 " << s[i];
          break;
        }
      }
      if (s[i] == d[j]) break;
    }
    if (s[i] != d[j]) cout << "NO" << endl;
  }
  return 0;
}
