#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")";
}

auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}";
}

#ifdef LOCAL
#define deb(x...) cerr << "[" #x << "]: ", [](auto...$) { ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

const int N=1e6+5;
vector<int> E[N], E2[N];
int deg[N];

set<pii> S;
bool check(int a, int b){
    if(S.count({a,b}))return 0;
    S.insert({a, b});
    if(deg[a]*10>deg[b]){
        int wsk=0;
        //deb(E2[a], E2[b]);
        for(int i:E2[a]){
            while(wsk<E2[b].size() && E2[b][wsk]!=i)wsk++;
            if(E2[b].size()==wsk)return 1;
        }
    }
    else{
        for(int i:E2[a]){
            if(!binary_search(all(E2[b]), i))return 1;
        }
    }
    return 0;
}

void solve() {
    int n, m;
    cin>>n>>m;
    for(int i=1; i<=n; i++){
        int k;
        cin>>k;
        deg[i]=k;
        for(int j=0; j<k; j++){
            int u;
            cin>>u;
            E[u].pb(i);
            E2[i].pb(u);
        }
        sort(all(E2[i]));
    }
    bool czy=0;
    pii ans;
    for(int i=1; i<=m; i++){
        sort(all(E[i]), [](int a ,int b){
            if(deg[a]==deg[b])return a<b;
            return deg[a]<deg[b];});
        for(int j=1; j<E[i].size(); j++){
            if(check(E[i][j-1], E[i][j])){
                ans={E[i][j-1], E[i][j]};
                czy=1;
                break;
            }
        }
        if(czy)break;
    }
    if(czy){
        cout<<"YES\n";
        cout<<ans.st<<" "<<ans.nd<<"\n";
    }
    else cout<<"NO\n";

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    //cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}