#include <bits/stdc++.h>
using namespace std;
set<int> s[201000];
set<int> t;
vector<int> seq[201000];
int ssum[201000];
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 0; i < k; i++) {
    int n;
    scanf("%d", &n);
    for (int j = 0; j < n; j++) {
      int t;
      scanf("%d", &t);
      seq[i].push_back(t);
      ssum[i] += t;
    }
    for (int j = 0; j < n; j++) {
      int ins = ssum[i] - seq[i][j];
      if (t.find(ins) != t.end()) {
        for (int new_t = 0; new_t < i; new_t++) {
          if (s[new_t].find(ins) != s[new_t].end()) {
            for (int new_idx = 0; new_idx < seq[new_t].size(); new_idx++) {
              if (ssum[new_t] - seq[new_t][new_idx] == ins) {
                printf("YES\n");
                printf("%d %d\n", new_t + 1, new_idx + 1);
                printf("%d %d\n", i + 1, j + 1);
                return 0;
              }
            }
          }
        }
      }
    }
    for (int j = 0; j < n; j++) {
      int ins = ssum[i] - seq[i][j];
      if (s[i].find(ins) == s[i].end()) {
        s[i].insert(ins);
        t.insert(ins);
      }
    }
  }
  printf("NO\n");
  return 0;
}
