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 a[2000];
int b[2000];
int main() {
  int m;
  cin >> m;
  while (m--) {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int j = 0; j < k; j++) cin >> b[j];
    sort(a, a + n);
    sort(b, b + k);
    int num = 0;
    int flag;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < k; j++) {
        flag = 0;
        if (b[j] == a[i]) {
          flag = 1;
          num = a[i];
          break;
        }
      }
      if (flag == 1) break;
    }
    if (num != 0) {
      cout << "YES" << endl;
      ;
      cout << 1 << ' ' << num << endl;
    } else
      cout << "NO" << endl;
  }
}
