#include <bits/stdc++.h>
using namespace std;
long long ind = 1, n, k, ans, a[200001];
pair<int, pair<int, int>> p[200000];
int main() {
  cin >> k;
  for (int i = 1; i <= k; i++) {
    cin >> n;
    ans = 0;
    for (int j = 1; j <= n; j++) {
      cin >> a[j];
      ans += a[j];
    }
    for (int j = 1; j <= n; j++) {
      p[ind].first = ans - a[j];
      p[ind].second.first = i;
      p[ind].second.second = j;
      ind++;
      a[j] = 0;
    }
  }
  ind--;
  sort(p + 1, p + ind + 1);
  for (int i = 1; i <= ind; i++) {
    if (p[i].first == p[i + 1].first &&
        p[i].second.first != p[i + 1].second.first) {
      cout << "YES" << endl;
      cout << p[i].second.first << " " << p[i].second.second << endl;
      cout << p[i + 1].second.first << " " << p[i + 1].second.second << endl;
      return 0;
    }
  }
  cout << "NO";
}
