#include <bits/stdc++.h>
using namespace std;
template <typename T>
long long max(long long x, long long y) {
  return x > y ? x : y;
}
template <typename T>
long long min(long long x, long long y) {
  return x < y ? x : y;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long k;
  cin >> k;
  map<long long, vector<pair<long long, long long> > > m;
  for (long long j = 1; j <= k; j++) {
    long long n;
    cin >> n;
    long long a[n];
    long long sm = 0;
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
      sm += a[i];
    }
    for (int i = 0; i < n; ++i) {
      m[sm - a[i]].push_back({j, i + 1});
    }
  }
  for (auto i : m) {
    vector<pair<long long, long long> > v = i.second;
    if (v.size() >= 2) {
      sort(v.begin(), v.end());
      if (v[0].first != v[v.size() - 1].first) {
        cout << "YES\n";
        cout << v[0].first << " " << v[0].second << "\n";
        cout << v[v.size() - 1].first << " " << v[v.size() - 1].second << "\n";
        return 0;
      }
    }
  }
  cout << "NO";
}
