#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  map<int, vector<int>> m;
  int count = 0;
  int A = 0, B = 0, B1 = 0, A1 = 0;
  while (k) {
    int n;
    cin >> n;
    int sum = 0;
    vector<int> a;
    count++;
    for (int i = 0; i < n; i++) {
      int d;
      cin >> d;
      a.push_back(d);
      sum += d;
    }
    if (A == 0) {
      for (int i = 0; i < n; i++) {
        int diff = sum - a[i];
        if (m[diff].size() == 0) {
          m[diff].push_back(count);
          m[diff].push_back(i + 1);
        } else if (m[diff][0] != count) {
          A = count;
          A1 = i + 1;
          B = m[diff][0];
          B1 = m[diff][1];
        }
      }
    }
    k--;
  }
  if (A == 0)
    cout << "NO";
  else {
    cout << "YES" << endl;
    cout << A << " " << A1 << endl;
    cout << B << " " << B1;
  }
  return 0;
}
