Special Number Check

In this problem, you are given an integer (y) and a list of (m) integers. Your task is to determine whether (y) is a special number. A number (y) is defined as special if there exists at least one integer (a) in the list such that (y \mod a = 0).

inputFormat

The input consists of two lines. The first line contains two integers (m) and (y), where (m) represents the number of elements in the list and (y) is the number to check. The second line contains (m) space-separated integers.

outputFormat

Output a single integer: print 1 if (y) is a special number (i.e., there exists at least one integer (a) in the list such that (y \mod a = 0)); otherwise, print 0.## sample

3 15
3 5 7

1