#include <bits/stdc++.h>
using namespace std;
long long a[200010];
map<long, int> tep;
map<long, map<int, int> > tem;
int main() {
  int t, n, cnt = 0;
  long long m, sum = 0;
  cin >> t;
  for (int j = 0; j < t; j++) {
    cin >> n;
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
      sum += a[i];
    }
    for (int i = 0; i < n; ++i)
      if (tep[sum - a[i]] == 0 || tem[sum - a[i]][1] == j) {
        tep[sum - a[i]] = 1;
        tem[sum - a[i]][1] = j;
        tem[sum - a[i]][2] = i;
      } else {
        cnt = 1;
        cout << "YES\n";
        cout << tem[sum - a[i]][1] + 1 << " " << tem[sum - a[i]][2] + 1 << endl;
        cout << j + 1 << " " << i + 1;
        break;
      }
    sum = 0;
    if (cnt == 1) break;
  }
  if (cnt == 0) cout << "NO";
  return 0;
}
