#include <bits/stdc++.h>
using namespace std;
map<int, pair<int, int> > mp;
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) {
    int n, sum = 0;
    scanf("%d", &n);
    vector<int> a;
    for (int j = 1, x; j <= n; j++) {
      scanf("%d", &x);
      a.push_back(x);
      sum += x;
    }
    for (int j = 0; j <= n - 1; j++) {
      if (mp.count(sum - a[j]) != 0) {
        printf("YES\n");
        printf("%d %d\n", i, j + 1);
        printf("%d %d\n", mp[sum - a[j]].first, mp[sum - a[j]].second);
        return 0;
      }
    }
    for (int j = 0; j <= n - 1; j++) {
      mp[sum - a[j]] = {i, j + 1};
    }
  }
  printf("NO\n");
}
