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 m, c = 0, n, q[50], a = 0;
    cin >> m >> n;
    int s1[m], s2[n];
    int i, j;
    for (i = 0; i < m; i++) cin >> s1[i];
    for (i = 0; i < n; i++) cin >> s2[i];
    for (i = 0; i < m; i++) {
      for (j = 0; j < n; j++) {
        if (s1[i] == s2[j]) {
          c = 0;
          for (int k = 0; k + j < n; k++) {
            if (s1[k + i] == s2[k + j]) {
              c++;
              for (int p = 0; p < c; p++) q[p] = s1[k + i];
            } else
              break;
          }
          if (c > a) {
            a = c;
          }
        }
      }
    }
    if (a > 0) {
      cout << "YES" << endl;
      cout << a << " ";
      for (i = 0; i < c; i++) cout << q[i] << " ";
    } else {
      cout << "NO" << endl;
      cout << a << endl;
    }
  }
}
