#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, pair<int, int> > p1, pair<int, pair<int, int> > p2) {
  return p1.first < p2.first;
}
int main() {
  int k;
  cin >> k;
  vector<int> vc[k + 1];
  vector<pair<int, pair<int, int> > > tri;
  for (int i = 0; i < k; i++) {
    int x;
    cin >> x;
    int sum = 0;
    for (int j = 0; j < x; j++) {
      int temp;
      cin >> temp;
      vc[i].push_back(temp);
      sum += temp;
    }
    for (int j = 0; j < x; j++) {
      tri.push_back({sum - vc[i][j], {i, j}});
    }
  }
  sort(tri.begin(), tri.end(), cmp);
  int len = tri.size();
  for (int i = 1; i < len; i++) {
    if (tri[i - 1].first == tri[i].first) {
      if (tri[i - 1].second.first != tri[i].second.first) {
        cout << "YES" << endl;
        cout << ++tri[i - 1].second.first << " " << ++tri[i - 1].second.second
             << endl;
        cout << ++tri[i].second.first << " " << ++tri[i].second.second << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
