#include <bits/stdc++.h>
using namespace std;
int v[200100];
int main() {
  vector<pair<int, pair<int, int> > > t;
  int k;
  cin >> k;
  for (int s = 0; s < k; ++s) {
    int n;
    cin >> n;
    int sum = 0;
    for (int i = 0; i < n; ++i) cin >> v[i], sum += v[i];
    for (int i = 0; i < n; ++i) {
      t.push_back(pair<int, pair<int, int> >(sum - v[i], pair<int, int>(s, i)));
    }
  }
  sort(t.begin(), t.end());
  for (int i = 0; i + 1 < (int)t.size();) {
    int y = 1;
    while ((int)t.size() > i + y && t[i].first == t[i + y].first &&
           t[i].second.first == t[i + y].second.first)
      y++;
    if ((int)t.size() > i + y && t[i].first == t[i + y].first &&
        t[i].second.first != t[i + y].second.first) {
      cout << "YES\n";
      cout << t[i].second.first + 1 << ' ' << t[i].second.second + 1 << '\n';
      cout << t[i + y].second.first + 1 << ' ' << t[i + y].second.second + 1
           << '\n';
      return 0;
    }
    i += y;
  }
  cout << "NO\n";
  return 0;
}
