#include <bits/stdc++.h>
using namespace std;

#define fwd(i, a, n) for (int i = (a); i < (n); i ++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) begin(X), end(X)
#define sz(X) ((int)X.size())
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define ull unsigned long long

#ifdef LOC
auto &operator<<(auto &out, pair<auto, auto> a) {
    return out << "(" << a.st << ", " << a.nd << ")";
}

auto &operator<<(auto &out, auto a) {
    out << "{";
    for (auto b : a)
        out << b << ", ";
    return out << "}";
}

void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif


int32_t main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vi> ids(m);
    vector<set<int> > dudes(n);
    rep(i, n) {
        int k;
        cin >> k;
        rep(j, k) {
            int x;
            cin >> x;
            x --;
            dudes[i].insert(x);
        }
        if (k > 1) {
            for (auto x : dudes[i])
                ids[x].push_back(i);
        }
    }
    rep(i, m) {
        if (sz(ids[i]) < 2)
            continue;
        sort(all(ids[i]), [&](int a, int b) {
            return sz(dudes[a]) < sz(dudes[b]);
        });
        fwd(j, 1, sz(ids[i])) {
            bool has = true;
            int l = ids[i][0];
            int r = ids[i][j];
            for (auto x : dudes[l])
                if (dudes[r].find(x) == end(dudes[r]))
                    has = false;
            if (has == false) {
                cout << "YES\n";
                cout << l + 1 << ' ' << r + 1 << '\n';
                return 0;
            }
        }
    }
    cout << "NO\n";
    return 0;
}