#include <bits/stdc++.h>
using namespace std;
int k, N;
int n[200005], temp[200005];
set<int> st;
struct str {
  int i, s, n;
} v[200005];
vector<str> v2;
bool cmp(str s1, str s2) { return s1.s < s2.s; }
int main() {
  ios_base::sync_with_stdio(0);
  cin >> k;
  for (int i = 0; i < k; i++) {
    int sum = 0;
    cin >> n[i];
    for (int j = 0; j < n[i]; j++) {
      cin >> temp[j];
      sum += temp[j];
    }
    for (int j = 0; j < n[i]; j++) {
      if (st.count(sum - temp[j])) continue;
      v[N].i = j;
      v[N].n = i;
      v[N].s = sum - temp[j];
      st.insert(v[N].s);
      N++;
    }
    st.clear();
  }
  sort(v, v + N, cmp);
  bool ans = false;
  for (int i = 1; i < N; i++)
    if (!ans && v[i].s == v[i - 1].s) {
      ans = true;
      cout << "YES" << endl;
      cout << v[i - 1].n + 1 << " " << v[i - 1].i + 1 << endl;
      cout << v[i].n + 1 << " " << v[i].i + 1 << endl;
    }
  if (!ans) cout << "NO" << endl;
  return 0;
}
