#include <bits/stdc++.h>
using namespace std;
int a[200005];
map<int, pair<int, int> > m;
int main() {
  int k, n, flag = 0;
  cin >> k;
  for (int i = 1; i <= k; i++) {
    int sum = 0;
    memset(a, 0, sizeof(a));
    cin >> n;
    for (int j = 1; j <= n; j++) {
      scanf("%d", &a[j]);
      sum += a[j];
    }
    for (int j = 1; j <= n; j++) {
      if (m.find(sum - a[j]) != m.end()) {
        if (i != m[sum - a[j]].first) {
          cout << "YES" << endl;
          cout << m[sum - a[j]].first << " " << m[sum - a[j]].second << endl;
          cout << i << " " << j << endl;
          return 0;
        }
      } else {
        m[sum - a[j]] = make_pair(i, j);
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
