def S(m,n):
    if m == 0:
        if n == 0:
            return 1
        else:
            return 0
    else:
        return n*S(m-1,n)+S(m-1,n-1)

def memo(f):
    m = {}
    def g(x,y):
        if (x,y) not in m:
            m[(x,y)] = f(x,y)
        return m[(x,y)]
    return g

S = memo(S)
for _ in range(int(input())):
    p,k,t,l = map(int, input().split())
    if S(p,k) * t <= l:
        print("Acceptable")
    else:
        print("Too Long")
#    print(S(p,k))