CF988 C. Equal Sums

#include<iostream>
#include<map>
#include<vector>
using namespace std;
map<int,pair<int,int> >m;
vector<int>arr;
int main()
{
    int k;
    cin>>k;
    for(int i = 0; i < k; i ++){
        int n,tmp,sum = 0;
        cin>>n;
        for(int j = 0; j < n; j ++){
            cin>>tmp;
            arr.push_back(tmp);
            sum += tmp;
        }
        for(int j= 0; j < n; j ++){
            if(m.find(sum - arr[j]) == m.end()){
                m[sum-arr[j]] = make_pair(i + 1, j + 1);
            }
            else{
                if((i + 1) != m[sum-arr[j]].first){
                    cout<<"YES"<<endl;
                    cout<<m[sum-arr[j]].first<<" "<<m[sum-arr[j]].second<<endl;
                    cout<<i + 1<<" "<<j + 1;
                    return 0;
                }
            }
        }
        arr.clear();

    }
    cout<<"NO"<<endl;
    return 0;
}