Help me in solving AO12 problem

help
,
1

My issue

Time Limit Exceeded. Couldnt able to submit

My code

# Update the code below to solve the problem

t = int(input())
for i in range(t):
    N, X = map(int, input().split())
    A = list(map(int, input().split()))
    destroy=0
    for i in range(N):
        if (A[i]<X):
            destroy=0
            for j in range(i+1):
                destroy+=1
    print(destroy)

Learning course: Python with Data structures
Problem Link: CodeChef: Practical coding for everyone