#include <bits/stdc++.h>

using namespace std;
using vi = vector<int>;
using pi = pair<int, int>;

const int nax = 200 * 1000 + 10, qax = 1000 * 1000 + 10;
int n, m;
vi vec[nax];
pi g[nax];
int col[qax];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		int k;
		cin >> k;
		for (int x, j = 0; j < k; ++j) {
			cin >> x;
			vec[i].push_back(x);
		}
		g[i] = {k, i};
	}
	sort(g+1, g + n+1);
	for (int i =1; i <= n; ++i) {
		auto [sz, id] = g[i];
		map<int,int>cnt;
		for (int x : vec[id]) {
			cnt[col[x]]++;
			col[x] = id;
		}
		for (auto [a,b] : cnt) {
			if (a != 0 && (int)vec[a].size() != b) {
				cout << "YES\n";
				cout << id << " " << a << "\n";
	
				return 0;
			}
		}
	

	}
	cout << "NO";
}