Guys what will be the time complexity for this?


#1
class Solution:
    # @param A : list of integers
    # @param B : integer
    # @param C : integer
    # @return an integer
    def numRange(self, A, B, C):
        count=0
        for i in range(len(A)):
            for j in range(i+1, len(A)):
                if B<=sum(A[i:j+1])<=C:
                    count+=1
                elif sum(A[i:j+1])>C:
                    break
        return count