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;
bool flag;
int t, n[1010], m[1010];
const int MAXN = 1e3 + 10;
int a[MAXN][MAXN], b[MAXN][MAXN];
int main() {
  cin >> t;
  for (int i = 0; i < t; i++) {
    cin >> n[i] >> m[i];
    for (int j = 0; j < n[i]; j++) cin >> a[i][j];
    for (int j = 0; j < m[i]; j++) cin >> b[i][j];
  }
  for (int i = 0; i < t; i++) {
    flag = 0;
    for (int j = 0; j < n[i]; j++) {
      for (int k = 0; k < m[i]; k++) {
        if (a[i][j] == b[i][k]) {
          cout << "YES" << endl;
          cout << 1 << " " << a[i][j] << endl;
          flag = 1;
          break;
        }
      }
      if (flag == 1) break;
    }
    if (flag == 0) cout << "NO" << endl;
  }
  return 0;
}
