#include <bits/stdc++.h>
using namespace std;
map<long long, pair<int, int>> m_map;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int size;
    cin >> size;
    int sum = 0;
    vector<int> temp;
    for (int j = 0; j < size; ++j) {
      int number;
      cin >> number;
      sum += number;
      temp.push_back(number);
    }
    for (int j = 0; j < size; ++j) {
      int temp_sum = sum - temp[j];
      auto itor = m_map.find(temp_sum);
      if (itor != m_map.end()) {
        cout << "YES" << endl;
        cout << itor->second.first << " " << itor->second.second + 1 << endl;
        cout << i + 1 << " " << j + 1 << endl;
        return 0;
      }
    }
    for (int j = 0; j < size; ++j) {
      int temp_sum = sum - temp[j];
      auto itor = m_map.find(temp_sum);
      m_map[temp_sum] = {i + 1, j};
    }
  }
  cout << "NO";
  return 0;
}
