#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int SIZE = 2e5 + 100;
constexpr int inf = 2e9;
vector<int> t[SIZE];
map<int, set<int>> m;
void solve() {
  int k;
  cin >> k;
  for (int i = 0; i < k; i++) {
    int n;
    cin >> n;
    int sum = 0;
    for (int j = 0; j < n; j++) {
      int x;
      cin >> x;
      sum += x;
      t[i].push_back(x);
    }
    for (int p : t[i]) {
      m[sum - p].insert(i);
    }
  }
  for (const auto &p : m) {
    if (p.second.size() > 1) {
      cout << "YES\n";
      auto it = p.second.begin();
      int xx = *it;
      it++;
      int yy = *it;
      int sumx = -p.first;
      int sumy = -p.first;
      for (int q : t[xx]) {
        sumx += q;
      }
      for (int q : t[yy]) {
        sumy += q;
      }
      for (int i = 0; i < t[xx].size(); i++) {
        if (t[xx][i] == sumx) {
          cout << xx + 1 << " " << i + 1 << "\n";
          break;
        }
      }
      for (int i = 0; i < t[yy].size(); i++) {
        if (t[yy][i] == sumy) {
          cout << yy + 1 << " " << i + 1 << "\n";
          break;
        }
      }
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
}
