#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  vector<pair<int, pair<int, int>>> a;
  for (int i = 0; i < k; i++) {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int j = 0; j < n; j++) {
      cin >> v[j];
    }
    int sum = accumulate(v.begin(), v.end(), 0);
    for (int k = 0; k < n; k++) {
      a.push_back({sum - v[k], {i, k}});
    }
  }
  stable_sort(a.begin(), a.end());
  for (int i = 0; i < (int)a.size() - 1; i++) {
    if (a[i].first == a[i + 1].first &&
        a[i].second.first != a[i + 1].second.first) {
      cout << "YES"
           << "\n";
      cout << a[i].second.first + 1 << " " << a[i].second.second + 1 << "\n";
      cout << a[i + 1].second.first + 1 << " " << a[i + 1].second.second + 1
           << "\n";
      return 0;
    }
  }
  cout << "NO\n";
  return 0;
}
