1992F - Valuable Cards - CodeForces Solution

def solve() -> None:
    n, x = map(int, input().split())
    a = list(map(int, input().split()))
    
    p = 1
    seen = set()
    for y in a:
        q, r = divmod(x, y)
        if r or y == 1:
            continue
        
        c = seen.copy()
        for z in c:
            if x == z * y:
                p += 1
                seen.clear()
                break
            
            if x % (z * y) == 0:
                seen.add(z * y)
        
        seen.add(y)
    
    print(p)
    
t = int(input())
for _ in range(t):
    solve()