#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
struct ele {
  int value, jj, index;
};
bool ordena(ele a, ele b) { return a.value < b.value; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int k, n;
  cin >> k;
  vector<ele> arr;
  for (int i = 0; i < k; i++) {
    int v[200010], sum = 0;
    cin >> n;
    for (int j = 0; j < n; j++) {
      cin >> v[j];
      sum += v[j];
    }
    for (int j = 0; j < n; j++) {
      ele myele;
      myele.value = sum - v[j];
      myele.jj = j;
      myele.index = i;
      arr.push_back(myele);
    }
  }
  sort(arr.begin(), arr.end(), ordena);
  for (int i = 0; i < arr.size() - 1; i++) {
    if (arr[i].value == arr[i + 1].value && arr[i].index != arr[i + 1].index) {
      cout << "YES" << '\n';
      cout << arr[i].index + 1 << " " << arr[i].jj + 1 << '\n';
      cout << arr[i + 1].index + 1 << " " << arr[i + 1].jj + 1 << '\n';
      return 0;
    }
  }
  cout << "NO" << '\n';
  return 0;
}
