#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  scanf("%d", &k);
  vector<int> vec[k + 5];
  set<pair<int, pair<int, int> > > st;
  for (int i = 0, n; i < k; i++) {
    scanf("%d", &n);
    int total = 0;
    for (int j = 0, x; j < n; j++) {
      scanf("%d", &x);
      vec[i].push_back(x);
      total += x;
    }
    vector<int> sum;
    for (int j = 0; j < n; j++) {
      sum.push_back(total - vec[i][j]);
      set<pair<int, pair<int, int> > >::iterator it =
          st.lower_bound(make_pair(sum[j], make_pair(0, 0)));
      if (it != st.end()) {
        if (it->first == sum[j]) {
          printf("YES\n");
          printf("%d %d\n", it->second.first + 1, it->second.second + 1);
          printf("%d %d\n", i + 1, j + 1);
          return 0;
        }
      }
    }
    for (int j = 0; j < sum.size(); j++)
      st.insert(make_pair(sum[j], make_pair(i, j)));
  }
  printf("NO\n");
  return 0;
}
