#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int main() {
  int k;
  cin >> k;
  int i, j;
  vector<int> v[k + 1];
  vector<pair<int, pair<int, int> > > p;
  for (i = 0; i < k; i++) {
    int n;
    cin >> n;
    int sum = 0;
    for (j = 0; j < n; j++) {
      int a;
      cin >> a;
      sum += a;
      v[i + 1].push_back(a);
    }
    for (j = 0; j < n; j++) {
      p.push_back(make_pair(sum - v[i + 1][j], make_pair(i + 1, j + 1)));
    }
  }
  sort(p.begin(), p.end());
  for (i = 0; i < p.size() - 1; i++) {
    if (p[i].first == p[i + 1].first and
        p[i].second.first != p[i + 1].second.first) {
      cout << "YES\n";
      cout << p[i].second.first << " " << p[i].second.second << "\n";
      cout << p[i + 1].second.first << " " << p[i + 1].second.second << "\n";
      return 0;
    }
  }
  cout << "NO\n";
}
