#include <bits/stdc++.h>
using namespace std;
vector<int> v[200005];
int sum[200005];
set<pair<int, int> > s[200005];
map<int, int> m;
map<int, int> fre;
int main() {
  int k;
  cin >> k;
  for (int i = 0; i < k; i++) {
    int n;
    cin >> n;
    v[i].push_back(n);
    int ss = 0;
    for (int j = 0; j < n; j++) {
      int x;
      cin >> x;
      v[i].push_back(x);
      ss = ss + x;
    }
    for (int j = 1; j <= n; j++) {
      if (m[ss - v[i][j]] == 0) {
        s[i].insert(make_pair(ss - v[i][j], j));
        m[ss - v[i][j]]++;
        fre[ss - v[i][j]]++;
      }
    }
    m.clear();
  }
  int key = INT_MIN;
  int c = 0;
  for (auto it = fre.begin(); it != fre.end(); it++) {
    if (it->second >= 2) {
      c = 1;
      key = it->first;
      break;
    }
  }
  if (c == 0) {
    cout << "NO";
    return 0;
  } else {
    cout << "YES\n";
    int cc = 0;
    for (int i = 0; i < k; i++) {
      for (auto it = s[i].begin(); it != s[i].end(); it++) {
        if ((*it).first == key) {
          cout << i + 1 << " " << (*it).second << "\n";
          cc++;
        }
        if (cc == 2) {
          return 0;
        }
      }
    }
  }
}
