from bisect    import bisect_right
from itertools import accumulate

def next_line():
    return input()
    
def next_int():
    return int(next_line())
    
def next_imap(): 
    return map(int,next_line().split())

def solve(n,x,partial_sum):
    dp = [0]*(2*(n+1))
    ans = 0
    for i in range(n-1,-1,-1):
        j = bisect_right(partial_sum,partial_sum[i]+x)-1
        dp[i] = dp[j+1]+j-i
        ans += dp[i]
    return ans
        
for test_case in range(next_int()):
    n, x = next_imap()
    print(solve(n,x,[0]+list(accumulate(next_imap()))))