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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, n, m, x, cnt;
  cin >> t >> n >> m;
  map<long long, long long> make_pair;
  while (t--) {
    cnt = 0;
    long long p = n * m;
    while ((p)--) {
      cin >> x;
      make_pair[x]++;
    }
    long long y = make_pair.size();
    for (auto it : make_pair) {
      if (it.second == 2) {
        cout << "YES" << endl
             << "1"
             << " " << it.first << endl;
        break;
      }
      cnt++;
    }
    if (y == (cnt)) cout << "NO" << endl;
  }
  return 0;
}
