#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int maxn = 2e5 + 5;
int k, n, a[maxn];
struct node {
  int val;
  int x, y;
  node() {}
  node(int _val, int _x, int _y) : val(_val), x(_x), y(_y) {}
  bool operator<(const node &t) const { return val < t.val; }
};
vector<node> mmp;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> k;
  for (int i = 1; i <= k; i++) {
    cin >> n;
    int sum = 0;
    for (int j = 1; j <= n; j++) {
      cin >> a[j];
      sum += a[j];
    }
    for (int j = 1; j <= n; j++) {
      mmp.push_back(node(sum - a[j], i, j));
    }
  }
  sort(mmp.begin(), mmp.end());
  for (int i = 0; i < mmp.size() - 1; i++) {
    if (mmp[i].val == mmp[i + 1].val && mmp[i].x != mmp[i + 1].x) {
      cout << "YES" << endl;
      cout << mmp[i].x << " " << mmp[i].y << endl;
      cout << mmp[i + 1].x << " " << mmp[i + 1].y << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
}
