#include <bits/stdc++.h>
#pragma optimize("Ofast")
using namespace std;
using ll = long long;
const int N = 2e5 + 5;
map<int, pair<int, pair<int, int>>> f;
int seq_id1, seq_id2, pos1, pos2, id;
bool ans;
void getAns(int s, int seq_id, int pos) {
  seq_id1 = seq_id;
  pos1 = pos;
  seq_id2 = f[s].second.first;
  pos2 = f[s].second.second;
}
int main() {
  ios_base::sync_with_stdio(0);
  int k;
  cin >> k;
  while (k--) {
    ++id;
    int n;
    cin >> n;
    int a[n], sum = 0;
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
      sum += a[i];
    }
    if (ans == true) continue;
    map<int, bool> check;
    check.clear();
    for (int i = 0; i < n; ++i) {
      sum -= a[i];
      if (f[sum].first && !check[sum]) {
        getAns(sum, id, i + 1);
        ans = true;
        break;
      } else if (!check[sum]) {
        f[sum].first = true;
        f[sum].second.first = id;
        f[sum].second.second = i + 1;
        check[sum] = true;
      }
      sum += a[i];
    }
  }
  if (ans) {
    cout << "YES\n";
    cout << seq_id1 << ' ' << pos1 << "\n";
    cout << seq_id2 << ' ' << pos2 << "\n";
  } else
    cout << "NO\n";
  return 0;
}
