#include <bits/stdc++.h>
using namespace std;
int n, i, j, k, l, m, a[201010];
map<long long, pair<long long, long long> > q;
int main() {
  cin >> k;
  for (j = 1; j <= k; j++) {
    cin >> n;
    long long s = 0;
    for (i = 1; i <= n; i++) {
      cin >> a[i];
      s += a[i];
    }
    for (i = 1; i <= n; i++) {
      if (q.count(s - a[i])) {
        cout << "YES\n"
             << j << " " << i << "\n"
             << q[s - a[i]].first << " " << q[s - a[i]].second << "\n";
        return 0;
      }
    }
    for (i = 1; i <= n; i++) {
      q[s - a[i]].first = j;
      q[s - a[i]].second = i;
    }
  }
  cout << "NO";
}
