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

const int len = 1e6+5;
int arr[len], fir[len], id[len];
set<int> mys;

int main() {
    int n, m;
    scanf("%d %d", &n, &m);

    mys.insert(m+1);
    for (int i = 1; i <= m; i++)
        fir[i] = m+1;

    bool found = false;
    int a = -1, b = -1;
    for (int i = 0; i < n; i++) {
        int sz;
        scanf("%d", &sz);
        for (int j = 0; j < sz; j++)
            scanf("%d", &arr[j]);

        if (sz < 2)
            continue;

        int nex = *mys.lower_bound(sz+1);
        for (int j = 0; j < sz; j++) {
            if (fir[arr[j]] > nex) {
                found = true;
                a = i+1;
                b = id[nex];
            }
        }

        if (found) break;

        id[sz] = i+1;
        mys.insert(sz);
        for (int j = 0; j < sz; j++)
            fir[arr[j]] = min(fir[arr[j]], sz);
    }

    if (found)
        printf("YES\n%d %d\n", a, b);
    else
        printf("NO\n");
    return 0;
}