#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
long long int MOD1 = 998244353;
mt19937 tw(chrono::high_resolution_clock::now().time_since_epoch().count());
void solve() {
  long long int k, n, l = 0;
  cin >> k;
  vector<pair<long long int, pair<long long int, long long int>>> a;
  for (long long int i = 0; i < k; i++) {
    long long int sum = 0;
    cin >> n;
    vector<long long int> v(n);
    for (long long int j = 0; j < n; j++) {
      cin >> v[j];
      sum += v[j];
    }
    for (long long int j = 0; j < n; j++) {
      a.emplace_back(make_pair((sum - v[j]), make_pair(i + 1, j + 1)));
      l++;
    }
  }
  sort(a.begin(), a.end());
  for (long long int i = 0; i < l - 1; i++) {
    if (a[i].first == a[i + 1].first &&
        a[i].second.first != a[i + 1].second.first) {
      cout << "YES\n";
      cout << a[i].second.first << " " << a[i].second.second << '\n';
      cout << a[i + 1].second.first << " " << a[i + 1].second.second << '\n';
      return;
    }
  }
  cout << "NO\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
