#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  map<long long, pair<int, pair<int, int> > > mp;
  pair<int, pair<int, int> > p;
  int flag = 0;
  int a, b, c, d;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    int a[x];
    long long sum = 0;
    for (int k = 1; k <= x; k++) {
      cin >> a[k];
      sum += a[k];
    }
    if (flag == 0) {
      for (int j = 1; j <= x; j++) {
        long long temp = sum;
        temp -= a[j];
        if (mp[temp].first == 1 && mp[temp].second.first != i) {
          p = mp[temp];
          c = i;
          d = j;
          flag = 1;
        } else {
          mp[temp].first = 1;
          mp[temp].second.first = i;
          mp[temp].second.second = j;
        }
      }
    }
  }
  if (flag == 1) {
    cout << "YES" << endl;
    cout << p.second.first << " " << p.second.second << endl;
    cout << c << " " << d << endl;
  } else
    cout << "NO" << endl;
}
