#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int n;
vector<int> vec[MAXN];
map<int, pair<int, int> > mp;
int main() {
  cin >> n;
  cin.tie(0);
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    vec[i].resize(t);
    int sm = 0;
    for (int j = 0; j < t; j++) cin >> vec[i][j], sm += vec[i][j];
    for (int j = 0; j < t; j++)
      if (mp.count(sm - vec[i][j])) {
        int z = sm - vec[i][j];
        if (mp[z].first == i) continue;
        cout << "YES\n";
        cout << mp[z].first + 1 << " " << mp[z].second + 1 << "\n";
        cout << i + 1 << " " << j + 1 << "\n";
        return 0;
      } else
        mp[sm - vec[i][j]] = make_pair(i, j);
  }
  cout << "NO\n";
  return 0;
}
