#include <bits/stdc++.h>
using namespace std;
long long fX[] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
long long fY[] = {0, 0, 1, -1, 1, -1, 1, -1, 0};
long long fx[] = {1, -1, 0, 0};
long long fy[] = {0, 0, 1, -1};
map<long long, pair<long long, long long> > mp;
map<string, long long> mp1;
long long A[200005];
int main() {
  long long n, k, sum, c = 0, a, b, y, z;
  cin >> k;
  for (long long i = 1; i <= k; i++) {
    sum = 0;
    cin >> n;
    for (long long j = 1; j <= n; j++) cin >> A[j], sum += A[j];
    for (long long j = 1; j <= n; j++) {
      if (c == 1) break;
      long long x = sum - A[j];
      if (mp.count(x) == 0) {
        mp[x] = pair<long long, long long>(i, j);
      } else {
        if (mp[x].first != i) {
          c = 1;
          a = mp[x].first;
          b = mp[x].second;
          y = i;
          z = j;
          break;
        }
      }
    }
  }
  if (c == 1) {
    cout << "YES" << endl;
    cout << a << " " << b << endl;
    cout << y << " " << z << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
