#include <bits/stdc++.h>
// #define int int64_t
using namespace std;
constexpr int big = 256;
int N, M;
vector<int> v[200010];
vector<int> x[1000010];
bool ok(int a,int b){
    if(v[a].size()<v[b].size())swap(a,b);
    int in=0, out=0;
    for(auto x:v[b]){

        if(binary_search(v[a].begin(), v[a].end(), x))in++;
        else out++;
    }
    if(in && out)return 1;
    return 0;
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    cin>>N>>M;
    for(int i=0;i<N;i++){
        int k;
        cin>>k;
        while(k--){
            int z;
            cin>>z;
            v[i].push_back(z);
            x[z].push_back(i);
        }
        sort(v[i].begin(), v[i].end());
    }
    for(int i=0;i<=M;i++){
        sort(x[i].begin(), x[i].end(), [](int a, int b){
            if(v[a].size()==v[b].size())return a<b;
            return v[a].size()>v[b].size();
        });
    }
    vector<int> grandi;
    for(int i=0;i<N;i++){
        if(v[i].size()>big)grandi.push_back(i);
    }
    for(int i=0;i<grandi.size();i++){
        for(int j=0;j<grandi.size();j++){
            if(ok(grandi[i], grandi[j])){
                cout<<"YES\n";
                cout<<grandi[i]+1<<" "<<grandi[j]+1<<endl;
                return 0;
            }
        }
    }
    for(int i=0;i<=M;i++){
        if(x[i].size()==0)continue;
        int primo=x[i][0];
        for(auto s:x[i]){
            if(v[s].size()>big || s==primo)continue;
            if(ok(primo, s)){
                cout<<"YES\n";
                cout<<primo+1<<" "<<s+1<<endl;
                return 0;
            }
            primo = s;
        }
    }
    cout<<"NO"<<endl;
}