#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
int a[N];
map<int, vector<pair<int, int> > > mp;
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) {
    int sum = 0;
    int ni;
    scanf("%d", &ni);
    for (int j = 1; j <= ni; j++) {
      scanf("%d", a + j);
      sum += a[j];
    }
    for (int j = 1; j <= ni; j++) mp[sum - a[j]].push_back({i, j});
  }
  for (auto x : mp) {
    vector<pair<int, int> > v = x.second;
    int lasti = v[0].first, lastj = v[0].second;
    for (int k = 1; k < v.size(); k++) {
      int i = v[k].first, j = v[k].second;
      if (lasti != i) {
        cout << "YES" << endl;
        cout << lasti << " " << lastj << endl;
        cout << i << " " << j << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
