#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char *sdbg, TH h, TA... t) {
  while (*sdbg != ',') {
    cerr << *sdbg++;
  }
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, t...);
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
};
template <class T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
};
vector<string> split(string s) {
  istringstream buf(s);
  istream_iterator<string> beg(buf), end;
  vector<string> list(beg, end);
  return list;
}
bool isvowel(char c) {
  string s = "aeiouAEIOU";
  if (find(s.begin(), s.end(), c) != s.end()) return true;
  return false;
}
vector<long long> sieve(long long n) {
  vector<bool> prime(n + 1, true);
  prime[0] = prime[1] = 0;
  for (int i = 2; i * i <= n; i++) {
    if (prime[i])
      for (int j = i * i; j <= n; j += i) {
        prime[j] = 0;
      }
  }
  vector<long long> p;
  for (int i = 2; i <= prime.size(); i++)
    if (prime[i]) p.push_back(i);
  return p;
}
bool isprime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true && (n != 1);
}
bool cmp(const string &a, const string &b) {
  return (a.size() < b.size()) || (a.size() == b.size() && a < b);
}
void solve() {
  int k;
  cin >> k;
  map<long long, set<int> > m;
  map<long long, set<pair<long long, int> > > ans;
  long long res = -1;
  map<int, vector<long long> > output;
  for (int x = 0; x < k; x++) {
    int n;
    cin >> n;
    vector<long long> v(n);
    long long sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> v[i];
      sum += v[i];
    }
    output[x] = v;
    if (res == -1)
      for (int i = 0; i < n; i++) {
        m[sum - v[i]].insert(x);
        ans[sum - v[i]].insert(make_pair(x, i));
        if (m[sum - v[i]].size() > 1) {
          res = sum - v[i];
        }
      }
  }
  if (res == -1) {
    cout << "NO";
    return;
  }
  int count = 0;
  cout << "YES" << endl;
  int last_i = -1;
  for (auto &x : ans[res]) {
    int i = x.first;
    int val_i = x.second;
    if (last_i == i) {
      continue;
    }
    if (count == 2) break;
    cout << i + 1 << ' ' << val_i + 1;
    cout << endl;
    count++;
    last_i = i;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int test_case = 1; test_case <= t; test_case++) {
    solve();
  }
  return 0;
}
