1754D - Factorial Divisibility - CodeForces Solution

from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))



def solve():
    n, x = rl()
    A = rl()
    copies = dd(int)
    for a in A:    
        if a >= x: continue
        copies[a] += 1
    
    curr = x - 1 
    need = 0
    factor = x
    
    while curr >= 1:
        if need == 0 and copies[curr] != 0:
            need = factor

        if need > n:
            print ("No")
            return

        if need != 0:
            if need >= copies[curr]:
                need -= copies[curr]
            else:
                need = (need-copies[curr]) % factor
        
        need *= curr
            
        if factor <= n * 1000000:
            factor *= curr
        curr -= 1

    if need == 0:
        print ("Yes")
    else:
        print ("No")

mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()