class Solution {
    public int numberOfArrays(int[] differences, int lower, int upper) {
        long min = 0, max = 0, curr = 0;
        
        for(int d: differences){
            curr += d;
            min = Math.min(min, curr);
            max = Math.max(max, curr);
        }
        
        long rangeDifference = (upper-lower) - (max-min) + 1;
        return (int)Math.max(rangeDifference, 0);
    }
}