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

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;

#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define rep(i,a,b) for(auto i = (a); i < (b); ++i)
#define REP(i,n) rep(i,0,n)
#define all(v) begin(v), end(v)
#define sz(v) ((int) (v).size())
#define rs resize

struct dsu{ vi p; dsu(ll n) : p(n, -1){}
ll find(ll i){
    return p[i] < 0 ? i : p[i] = find(p[i]);
}
void unite(ll a, ll b){
    if((a == find(a)) == (b == find(b))) return;
    if(p[a] > p[b]) swap(a,b);
    p[a] += p[b]; p[b] = a;
}
};

signed main(){
    ll n, m;
    cin>>n;
    cin>>m;
    vector<vector<ll>> leuk;
    vector<pair<ll,ll>> aantal;
    ll k, nu;
    for(ll x=0;x<n;x++){
        cin>>k;
        aantal.push_back(make_pair(k,x));
        vector<ll> vec;
        for(ll y = 0; y<k;y++){
            cin>>nu;
            vec.push_back(nu - 1);
        }
        leuk.push_back(vec);
    }
    sort(aantal.begin(),aantal.end());
    dsu unie = dsu(m);
    vector<ll> grootte, nummer;
    vector<bool> gehad;
    for(ll x=0;x<m;x++){
        grootte.push_back(1);
        nummer.push_back(-1);
        gehad.push_back(false);
    }

    //Ga lopen
    bool gelukt = false, kan;
    ll som;
    ll i, j;
    for(ll x=0;x<n;x++){
        i = aantal[x].second;
        som = 0;
        vector<ll> vec;
        k = aantal[x].first;
        for(ll y = 0; y < k; y++){
            j = leuk[i][y];
            j = unie.find(j);
            if(!gehad[j]){
                vec.push_back(j);
                gehad[j] = true;
                som += grootte[j];
            }
        }
        if(som != k){
            vector<bool> mag;
            for(ll y = 0; y < m; y++){
                mag.push_back(true);
            }
            for(ll y = 0; y < k;y++){
                mag[leuk[i][y]] = false;
            }
            for(ll y = 0; y < vec.size(); y++){
                j = vec[y];
                kan = false;
                j = nummer[j];
                if(j == -1){
                    continue;
                }
                for(ll z = 0; z < leuk[j].size(); z++){
                    nu = leuk[j][z];
                    if(mag[nu]){
                        kan = true;
                        break;
                    }
                }
                if(kan){
                    cout << "YES" <<endl;
                    cout << (i+1)<< " " << (j+1)<<endl;
                    break;
                }
            }
            gelukt = true;
            break;
        }
        for(ll y = 0; y < vec.size();y++){
            gehad[vec[y]] = false;
            unie.unite(vec[0], vec[y]);
        }
        if(k > 0){
            j = unie.find(vec[0]);
            grootte[j] = k;
            nummer[j] = i;
        }
    }
    if(!gelukt){
        cout << "NO" << endl;
    }
    return 0;
}