#include <bits/stdc++.h>
using namespace std;
struct e {
  long long sum;
  int num, index;
};
struct cmp {
  bool operator()(const e &a, const e &b) { return a.sum < b.sum; }
};
int main() {
  const int INF = 1e9;
  const bool DEBUG = 0;
  if (DEBUG) {
    freopen("input.txt", "r", stdin);
  }
  int k;
  scanf("%d", &k);
  set<e, cmp> q;
  int a[200011];
  for (int i = 1; i <= k; i++) {
    int n;
    long long s = 0;
    scanf("%d", &n);
    for (int j = 1; j <= n; j++) {
      scanf("%d", &a[j]);
      s += a[j];
    }
    for (int j = 1; j <= n; j++) {
      e t;
      t.sum = s - a[j];
      t.index = j;
      t.num = i;
      auto it = q.find(t);
      if (it == q.end()) {
        q.insert(t);
      } else if ((*it).num != i) {
        printf("YES\n");
        e t1 = *it;
        printf("%d %d\n%d %d", t1.num, t1.index, i, j);
        return 0;
      }
    }
  }
  printf("NO");
}
