#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> nums[(int)2e5];
  int sums[(int)2e5];
  vector<pair<int, pair<int, int> > > res;
  int k;
  cin >> k;
  for (int i = 0; i < k; i++) {
    int n;
    scanf("%d", &n);
    sums[i] = 0;
    for (int j = 0; j < n; j++) {
      int temp;
      scanf("%d", &temp);
      nums[i].push_back(temp);
      sums[i] += temp;
    }
  }
  for (int i = 0; i < k; i++) {
    int tam = nums[i].size();
    for (int j = 0; j < tam; j++) {
      res.push_back(make_pair(sums[i] - nums[i][j], make_pair(i, j)));
    }
  }
  sort(res.begin(), res.end());
  for (int i = 0; i < res.size() - 1; i++) {
    if (res[i].first == res[i + 1].first) {
      if (res[i].second.first == res[i + 1].second.first) continue;
      cout << "YES" << endl;
      cout << res[i].second.first + 1 << " " << res[i].second.second + 1
           << endl;
      cout << res[i + 1].second.first + 1 << " " << res[i + 1].second.second + 1
           << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
