#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int inf = 1e16 + 7;
void SOLVE() {
  long long int k;
  cin >> k;
  map<long long int, pair<long long int, long long int>> make_pair;
  long long int k1, i1, k2, i2;
  bool ok = false;
  for (long long int i = 1; i < k + 1; i++) {
    long long int n;
    cin >> n;
    vector<long long int> a(n);
    long long int sum = 0;
    for (long long int j = 0; j < n; j++) {
      cin >> a[j];
      sum += a[j];
    }
    for (long long int j = 0; j < n; j++) {
      pair<long long int, long long int> val = make_pair[sum - a[j]];
      if (!ok && val.first != i && val.first > 0) {
        ok = true;
        k1 = val.first;
        i1 = val.second;
        k2 = i;
        i2 = j + 1;
      }
      make_pair[sum - a[j]] = {i, j + 1};
    }
  }
  if (ok) {
    cout << "YES" << endl;
    cout << k1 << " " << i1 << endl;
    cout << k2 << " " << i2 << endl;
  } else {
    cout << "NO\n";
  }
}
int32_t main() {
  std::ios_base::sync_with_stdio(false);
  ;
  SOLVE();
  return 0;
}
