int n = jumps.size();
        int mini = 1e9;
        int sum = 0;
        for(auto &it:jumps){
            sum+=it;
            mini = min(mini,sum);
        }
        if(mini>0) cout<<1;
        else cout<<(mini*(-1))+1;

        int n = prices.size();
        vector<long long int> prefix(n+1,0);
        prefix[0]=0;
       long long int sum = 0;
        for(int i=0;i<n;i++){
            sum+=prices[i];
            prefix[i+1]+=sum;
        }
        vector<int> rod(pos.size());
       for(int i=0;i<pos.size();i++){
          long long int po,amoun; 
           po = pos[i];
           amoun = amount[i];
          long long  int target = prefix[po-1]+amoun;
          long long int ans = upper_bound(prefix.begin(),prefix.end(),target)-prefix.begin();
           ans=ans-po;
           rod[i]=ans;
       }
       return rod;

int mod = 1e9+7;
        sort(intervals.begin(),intervals.end());
        vector<vector<int>> vt;
        int start=intervals[0][0];
        int end=intervals[0][1];
        for(int i=1;i<intervals.size();i++){
            if(end<intervals[i][0]){
                vector<int> temp;
                temp.push_back(start);
                temp.push_back(end);
                vt.push_back(temp);
                
                start=intervals[i][0];
                end=intervals[i][1];
                
            }else{
                end=max(end,intervals[i][1]);
            }
        }
        
        vector<int> temp;
        temp.push_back(start);
        temp.push_back(end);
        vt.push_back(temp);
        
        int cnt = vt.size();
        
        int ans = 1;
        
        for(int i=1;i<=cnt;i++){
            ans = (ans%mod * 2%mod)%mod;
        }
        
        return ans-2;