#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
const int N = 200005;
const int INF = 1e8;
const long long MOD1 = 998244353;
using namespace std;
bool comp(string a, string b) { return a.size() < b.size(); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  set<int> s;
  set<int> cur;
  long long sum = 0;
  vector<vector<int>> v(t);
  int pos1 = -1;
  int need = -1;
  int pos2 = -1;
  for (int k = 0; k < t; k++) {
    int n;
    sum = 0;
    cin >> n;
    v[k].resize(n);
    for (int i = 0; i < n; i++) {
      cin >> v[k][i];
      sum += v[k][i];
    }
    for (int i = 0; i < n; i++) {
      if (s.count(sum - v[k][i])) {
        pos1 = k + 1;
        pos2 = i + 1;
        need = sum - v[k][i];
        goto la;
      }
      cur.insert(sum - v[k][i]);
    }
    for (auto x : cur) s.insert(x);
    cur.clear();
  }
la:
  if (pos2 == -1) {
    cout << "NO";
    return 0;
  }
  cout << "YES";
  cout << endl;
  ;
  cout << pos1 << " " << pos2;
  cout << endl;
  ;
  for (int k = 0; k < t; k++) {
    sum = 0;
    for (auto x : v[k]) sum += x;
    int n = v[k].size();
    for (int i = 0; i < n; i++) {
      if (sum - v[k][i] == need) {
        cout << k + 1 << " " << i + 1;
        cout << endl;
        ;
        return 0;
      }
    }
  }
  return 0;
}
