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 a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    int b[m];
    for (int i = 0; i < m; i++) cin >> b[i];
    int freq[1000] = {0};
    for (int i = 0; i < n; i++) {
      if (freq[a[i] - 1] == 0) freq[a[i] - 1] = 1;
    }
    int flag = 0;
    int el = 0;
    for (int i = 0; i < m; i++) {
      if (freq[b[i] - 1] == 1) {
        flag = 1;
        el = b[i];
      }
    }
    if (flag == 0)
      cout << "NO" << endl;
    else
      cout << "YES" << endl << 1 << " " << el;
  }
  return 0;
}
