#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const long double eps = 1e-15;
int k, n, x;
set<int> a;
map<int, int> pos;
map<int, vector<pair<int, int> > > m;
int main() {
  cin >> k;
  for (int i = 1; i <= k; i++) {
    a.clear();
    cin >> n;
    int sum = 0;
    for (int j = 0; j < n && cin >> x; j++)
      sum += x, a.insert(x), pos[x] = j + 1;
    for (auto &j : a) m[sum - j].push_back(make_pair(i, pos[j]));
  }
  for (auto &i : m) {
    if (i.second.size() >= 2) {
      cout << "YES" << endl;
      cout << i.second[0].first << " " << i.second[0].second << endl;
      cout << i.second[1].first << " " << i.second[1].second << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
