Codeforces Round #486 (Div. 3), problem: (C) Equal Sums

/*
বন্ধু তুমি  একা  হলে  আমায় দিও  ডাক
তোমার সাথে গল্প করবো  আমি সারারাত
*/

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pli pair<long long int,int>
#define pbi pair<bool,int>
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)
#define maxarr(n,arr,m) m =-1e9;for(int i=0;i<n;i++)if(arr[i]>m) m=arr[i];

const double pi = acos(-1.0);
const int maxn = (i64)2e9+5;

int arr[200005];
map<int,pair<bool,pair<int,int> > > mp;

int main()
{
    int k,a,b,x,y;
    cin >> k;
    bool fg = false;
    for(int j = 1 ; j<=k ; j++)
    {
        int n;
        cin >> n;
        int s=0;
        for(int i =1 ; i<=n ; i++)
        {
            cin >> arr[i];
            s+=arr[i];
        }
        if(!fg)
        {
            for(int i =1 ; i<=n ; i++)
            {
                int t = s-arr[i];
                if(mp[t].first == 1 && mp[t].second.first!=j)
                {
                    fg = true;
                    a = mp[t].second.first;
                    x = mp[t].second.second;
                    b = j;
                    y = i;
                    break;
                }
                else if(mp[t].first == 0)
                {
                    mp[t].first = 1;
                    mp[t].second.first = j;
                    mp[t].second.second = i;
                }
            }
        }
    }
    if(fg)
    {
        cout << "YES" << endl;
        cout << a << " "<< x << endl;
        cout << b << " "<< y;
    }
    else cout << "NO";

return 0;
}