#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e13 + 7LL;
int k, tmp, n[200001];
vector<int> a[200001];
vector<tuple<int, int, int>> res;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> k;
  for (int i = 0; i < k; ++i) {
    cin >> n[i];
    int sum = 0;
    for (int j = 0; j < n[i]; ++j) cin >> tmp, sum += tmp, a[i].push_back(tmp);
    for (int j = 0; j < n[i]; ++j)
      res.push_back(make_tuple(sum - a[i][j], i, j));
  }
  sort(res.begin(), res.end());
  for (int i = 0; i < res.size() - 1; ++i) {
    if (get<0>(res[i]) == get<0>(res[i + 1]) &&
        get<1>(res[i]) != get<1>(res[i + 1]))
      return cout << "YES\n"
                  << get<1>(res[i + 1]) + 1 << ' ' << get<2>(res[i + 1]) + 1
                  << endl
                  << get<1>(res[i]) + 1 << ' ' << get<2>(res[i]) + 1,
             0;
  }
  cout << "NO";
}
