#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 19260817;
const long long mod2 = 19660813;
int n;
int m;
int a[400100];
struct node {
  int a;
  int b;
  int c;
  bool operator<(const node &t) const {
    return a < t.a || (a == t.a && b < t.b);
  }
};
vector<node> book;
pair<pair<int, int>, pair<int, int> > solve() {
  sort(book.begin(), book.end());
  for (int i = 1; i < book.size(); ++i) {
    if (book[i].a == book[i - 1].a && book[i].b != book[i - 1].b)
      return {{book[i - 1].b, book[i - 1].c}, {book[i].b, book[i].c}};
  }
  return {{-1, -1}, {-1, -1}};
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &m);
    int sum = 0;
    for (int j = 1; j <= m; ++j) scanf("%d", a + j);
    for (int j = 1; j <= m; ++j) sum += a[j];
    for (int j = 1; j <= m; ++j) book.push_back({sum - a[j], i, j});
  }
  pair<pair<int, int>, pair<int, int> > tmp = solve();
  if (tmp.first.first == -1)
    puts("NO");
  else {
    puts("YES");
    printf("%d %d\n", tmp.first.first, tmp.first.second);
    printf("%d %d\n", tmp.second.first, tmp.second.second);
  }
  return 0;
}
