拼多多笔试题第二题超时！

def solve(n,m,arr):
    result=0
    for i in range(n):
        num=i+1
        index=0
        while index<=n-num:
            he=sum(arr[index:index+num])
            if he%m==0:
                result+=1
            index=index+1
    return result

if __name__=='__main__':
    tmp=list(map(int,input().split(' ')))
    n=tmp[0]
    m=tmp[1]
    arr=list(map(int,input().split(' ')))
    result=solve(n,m,arr)
    print(result)