#include <bits/stdc++.h>
int main() {
  std::ios::sync_with_stdio(false);
  using namespace std;
  map<int, pair<int, int> > M;
  int k, n;
  vector<int> result;
  cin >> k;
  for (int i = 0; i < k; i++) {
    cin >> n;
    vector<int> A(n);
    for (int j = 0; j < n; j++) cin >> A[j];
    int s = accumulate(A.begin(), A.end(), 0);
    for (int j = 0; j < n; j++) {
      auto it = M.find(s - A[j]);
      if (it != M.end()) {
        result.push_back(it->second.first);
        result.push_back(it->second.second);
        result.push_back(i + 1);
        result.push_back(j + 1);
      }
    }
    if (result.size() > 0) break;
    for (int j = 0; j < n; j++) {
      auto it = M.find(s - A[j]);
      if (it == M.end()) M[s - A[j]] = {i + 1, j + 1};
    }
  }
  if (result.size()) {
    cout << "YES\n"
         << result[0] << " " << result[1] << "\n"
         << result[2] << " " << result[3] << "\n";
  } else {
    cout << "NO\n";
  }
  return 0;
}
