#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  cin >> k;
  vector<long long> inp[k];
  vector<pair<long long, pair<long long, long long>>> all_;
  for (int i = 0; i < (k); i++) {
    cin >> n;
    long long a;
    long long sum = 0;
    for (int j = 0; j < (n); j++) {
      cin >> a;
      inp[i].push_back(a);
      sum += a;
    }
    for (int j = 0; j < (n); j++) {
      long long w = inp[i][j];
      all_.push_back({sum - w, {i, j}});
    }
  }
  sort(all_.begin(), all_.end());
  bool succ = false;
  for (int i = 0; i < (all_.size() - 1); i++) {
    if (all_[i].first == all_[i + 1].first &&
        all_[i].second.first != all_[i + 1].second.first) {
      succ = true;
      cout << "YES" << endl;
      cout << all_[i].second.first + 1 << " " << all_[i].second.second + 1
           << endl;
      cout << all_[i + 1].second.first + 1 << " "
           << all_[i + 1].second.second + 1 << endl;
      break;
    }
  }
  if (!succ) cout << "NO" << endl;
  return 0;
}
