#include <bits/stdc++.h>
using namespace std;
struct data1 {
  long long sum, index, position;
};
bool comp(data1 a, data1 b) { return a.sum < b.sum; }
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  long long k;
  cin >> k;
  vector<data1> arr;
  long long sz = 0;
  for (long long i = 0; i < k; i++) {
    long long n;
    cin >> n;
    std::vector<long long> v(n);
    for (auto &x : v) cin >> x;
    long long sum = accumulate(v.begin(), v.end(), 0ll);
    for (long long j = 0; j < n; j++) {
      data1 d;
      d.sum = sum - v[j];
      d.index = i;
      d.position = j;
      arr.push_back(d);
      sz++;
    }
  }
  sort(arr.begin(), arr.end(), &comp);
  bool flag = false;
  for (long long i = 0; i < sz - 1; i++) {
    if (arr[i].sum == arr[i + 1].sum and arr[i].index != arr[i + 1].index) {
      cout << "YES\n";
      cout << arr[i].index + 1 << " " << arr[i].position + 1 << "\n";
      cout << arr[i + 1].index + 1 << " " << arr[i + 1].position + 1 << "\n";
      flag = true;
      break;
    }
  }
  if (flag) return 0;
  cout << "NO\n";
  return 0;
}
