#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9;
long double sqr(long double a) { return a * a; }
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  long long k;
  cin >> k;
  map<long long, pair<long long, long long> > sm;
  for (auto i = 0; i < k; ++i) {
    long long n, sum = 0;
    cin >> n;
    vector<long long> a(n);
    for (auto &it : a) {
      cin >> it;
      sum += it;
    }
    for (auto j = 0; j < n; ++j) {
      if (sm.find(sum - a[j]) != sm.end()) {
        cout << "YES\n"
             << sm[sum - a[j]].first << " " << sm[sum - a[j]].second << "\n"
             << i + 1 << " " << j + 1;
        return 0;
      }
    }
    for (auto j = 0; j < n; ++j) {
      sm[sum - a[j]] = {i + 1, j + 1};
    }
  }
  cout << "NO";
  return 0;
}
