#include <bits/stdc++.h>
using namespace std;
long long sq1, sq2, idx1, idx2, cn = 1;
map<long long, long long> ans;
bool flag = false;
struct corona {
  long long x, y, z;
};
void solve() {
  long long q, i, j, k, n, res;
  vector<corona> v;
  cin >> q;
  while (q--) {
    cin >> n;
    long long arr[n + 5], sum = 0;
    for (i = 1; i <= n; i++) {
      cin >> arr[i];
      sum += arr[i];
    }
    if (!flag) {
      map<long long, long long> mp;
      for (i = 1; i <= n; i++) {
        long long temp = sum + (-1 * arr[i]);
        if (mp[temp] == 0 && ans[temp] == 0) {
          mp[temp]++;
          ans[temp]++;
          v.push_back({temp, i, cn});
        } else if (mp[temp] == 0 && ans[temp] == 1) {
          flag = true;
          sq2 = cn;
          idx2 = i;
          res = temp;
          break;
        }
      }
    }
    cn++;
  }
  if (flag) {
    long long sz = v.size();
    for (i = 0; i < sz; i++) {
      if (v[i].x == res) {
        sq1 = v[i].z;
        idx1 = v[i].y;
      }
    }
    cout << "YES" << '\n';
    cout << sq1 << " " << idx1 << '\n';
    cout << sq2 << " " << idx2 << '\n';
  } else {
    cout << "NO" << '\n';
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
}
