#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-8;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 20;
long long k, n;
map<long long, pair<long long, long long> > M;
long long a[maxn];
long long first, second, id1, id2;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> k;
  bool flag = 0;
  for (long long i = 1; i <= k; i++) {
    cin >> n;
    long long sum = 0;
    for (long long j = 1; j <= n; j++) {
      cin >> a[j];
      sum += a[j];
    }
    if (flag) continue;
    for (int j = 1; j <= n; j++) {
      if (M.count(sum - a[j]) != 0 && M[sum - a[j]].first != i) {
        flag = 1;
        first = M[sum - a[j]].first;
        id1 = M[sum - a[j]].second;
        second = i;
        id2 = j;
        break;
      }
      M[sum - a[j]] = make_pair(i, j);
    }
  }
  if (!flag) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    cout << first << ' ' << id1 << endl;
    cout << second << ' ' << id2 << endl;
  }
  return 0;
}
