#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5;
map<int, pair<int, int> > mp;
int k;
int a[N];
int main() {
  cin >> k;
  for (int i = 1; i <= k; i++) {
    int n, sum = 0;
    cin >> n;
    for (int j = 1; j <= n; j++) cin >> a[j], sum += a[j];
    for (int j = 1; j <= n; j++) {
      if (mp.count(sum - a[j])) {
        cout << "YES" << endl;
        cout << mp[sum - a[j]].first << " " << mp[sum - a[j]].second << endl;
        cout << i << " " << j << endl;
        return 0;
      }
    }
    for (int j = 1; j <= n; j++) mp[sum - a[j]] = {i, j};
  }
  cout << "NO" << endl;
  return 0;
}
