#include <bits/stdc++.h>
using namespace std;
int c = 0;
bool flag = true;
map<long long, int> summ;
vector<pair<long long, int> > des;
int ara[200007];
stack<pair<int, int> > st;
int main() {
  int p, n;
  cin >> p;
  for (int k = 1; k <= p; k++) {
    cin >> n;
    long long sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> ara[i];
      sum += ara[i];
    }
    if (flag) {
      map<long long, int>::iterator it, itt;
      for (int i = 0; i < n; i++) {
        long long a = sum - ara[i];
        it = summ.find(a);
        if (it != summ.end()) {
          int pos = summ[a];
          if (des[pos].first != k) {
            st.push({des[pos].first, des[pos].second});
            st.push({k, i + 1});
            flag = false;
          }
        } else {
          summ[a] = c++;
          des.push_back({k, i + 1});
        }
      }
    }
  }
  if (st.empty())
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    cout << st.top().first << " " << st.top().second << endl;
    st.pop();
    cout << st.top().first << " " << st.top().second << endl;
  }
}
