#include <bits/stdc++.h>
using namespace std;
vector<long long> v[200005], n(200005);
map<long long, vector<pair<long long, long long> > > m;
int main() {
  long long i, j, f = 0, k, N;
  cin >> N;
  for (i = 1; i <= N; i++) {
    cin >> n[i];
    int sum = 0;
    for (int j = 1; j <= n[i]; j++) {
      cin >> k;
      sum += k;
      v[i].push_back(k);
    }
    for (int j = 1; j <= n[i]; j++) {
      m[sum - v[i][j - 1]].push_back({i, j});
    }
  }
  for (auto &sum : m) {
    sort((sum.second).begin(), (sum.second).end());
    for (int j = 1; j < sum.second.size(); j++) {
      if (sum.second[j].first != sum.second[j - 1].first) {
        cout << "YES\n";
        cout << sum.second[j].first << " " << sum.second[j].second << '\n';
        cout << sum.second[j - 1].first << " " << sum.second[j - 1].second
             << '\n';
        return 0;
      }
    }
  }
  cout << "NO\n";
  return 0;
}
