#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int main() {
  int k;
  while (cin >> k) {
    int n, flag = 0;
    map<long long int, pair<int, int>> loc;
    for (int i = 0; i < k; i++) {
      vector<long long int> nums;
      long long int sum = 0;
      cin >> n;
      for (int j = 0; j < n; j++) {
        int num;
        cin >> num;
        if (flag) continue;
        nums.push_back(num);
        sum += num;
      }
      if (flag) continue;
      for (int j = 0; j < n; j++) {
        nums[j] = sum - nums[j];
        if (loc.find(nums[j]) == loc.end()) {
          loc[nums[j]] = make_pair(i, j);
        } else if (loc[nums[j]].first != i) {
          cout << "YES" << endl;
          cout << loc[nums[j]].first + 1 << " " << loc[nums[j]].second + 1
               << endl;
          cout << i + 1 << " " << j + 1 << endl;
          flag = 1;
          break;
        }
      }
    }
    if (!flag) cout << "NO" << endl;
  }
  return 0;
}
