#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void print(vector<long long> a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << ' ';
  }
  cout << endl;
}
vector<long long> inp(int n) {
  vector<long long> a;
  long long x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    a.push_back(x);
  }
  return a;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, n, i, j, k, l, c, c1, cnt, flag, m1, m2, maxi, mini, x, y, z;
  vector<long long> a, b;
  string s, s1, s2;
  map<long long, pair<long long, long long> > m;
  pair<long long, long long> p;
  cin >> t;
  flag = 0;
  for (int i = 0; i < t; i++) {
    cin >> n;
    c = 0;
    for (int j = 0; j < n; j++) {
      cin >> x;
      a.push_back(x);
      c = c + x;
    }
    if (flag == 0) {
      for (int j = 0; j < n; j++) {
        if (m.find(c - a[j]) == m.end()) {
          p.first = j, p.second = i;
          m[c - a[j]] = p;
        } else {
          if (m[c - a[j]].second != i) {
            flag = 1;
            cout << "YES" << endl;
            cout << m[c - a[j]].second + 1 << ' ' << m[c - a[j]].first + 1
                 << endl;
            cout << i + 1 << ' ' << j + 1 << endl;
            break;
          }
        }
      }
    }
    a.clear();
  }
  if (flag == 0) {
    cout << "NO" << endl;
  }
}
