#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
const int N = 2e5 + 4;
const int M = 1e6 + 4;
vector<int> pe[N];
vector<int> li[M];
int nr[N],ind[N];
vector<int> g[N];
pair<int,int> a[N];
int ne[N];
set<pair<int,int>> s;

void find() {
    int n,m;
    cin>>n>>m;
    for (int i=1;i<=n;i++)
    {
        cin>>nr[i];
        for (int j=1;j<=nr[i];j++)
        {
            int x;
            cin>>x;
            pe[i].push_back(x);
            li[x].push_back(i);
        }
    }

    for (int i=1;i<=m;i++) {
        if (li[i].size() > 1) {
            int r=0;
            for (int x : li[i]) {
                a[++r] = {nr[x], x};
            }
            sort(a+1,a+r+1);
            for (int j=2;j<=n;j++)
                g[a[j-1].second].push_back(a[j].second);
        }
    }

    for (int i=1;i<=n;i++) {
        ind[i] = 0;
        ne[i] = 0;
    }

    for (int i=1;i<=n;i++)
        for (int x : g[i])
            ind[x]++;

    queue<int> q;

    for (int i=1;i<=n;i++) {
        if (ind[i]==0)
            q.push(i);
    }

    while (!q.empty()) {
        int x = q.front();
        q.pop();
        int Min=m+1;
        int pos=0;
        for (int y : g[x]) {
            if (nr[y]<Min) {
                Min = nr[y];
                pos=y;
            } else if (nr[y]<=Min)
                pos=min(pos,y);
        }
        if (Min<=m)
            ne[x]=pos;
        for (int y : g[x]) {
            ind[y]--;
            if (ind[y] == 0) {
                q.push(y);
            }
        }
    }

    for (int i=1;i<=n;i++)
        for (int y : pe[i])
            s.insert({i, y});
    bool sol=false;
    int p1=0;
    int p2=0;
    for (int i=1;i<=n && (!sol);i++) {
        if (ne[i]==0)
            continue;
        for (int y : pe[i])
            if (s.count({ne[i], y}) == 0) {
                sol = true;
                p1=i;
                p2=ne[i];
                break;
            }
    }

    if (sol) {
        cout<<"YES"<<'\n';
        cout<<p1<<" "<<p2;
    } else {
        cout<<"NO";
    }
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    while(t--) {
        find();
    }
    return 0;
}