Problem:
Score : 300 points

Problem Statement

There is a box containing N balls. The i-th ball has the integer A_i written on it.
Snuke can perform the following operation any number of times:

Take out two balls from the box. Then, return them to the box along with a new ball, on which the absolute difference of the integers written on the two balls is written.

Determine whether it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written.

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9

1 \leq K \leq 10^9

All input values are integers.

Input

Input is given from Standard Input in the following format:

N K
A_1 A_2 ... A_N

Output

If it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written, print POSSIBLE; if it is not possible, print IMPOSSIBLE.

Sample Input 1

3 7
9 3 4

Sample Output 1

POSSIBLE

First, take out the two balls 9 and 4, and return them back along with a new ball, abs(9-4)=5.
Next, take out 3 and 5, and return them back along with abs(3-5)=2.
Finally, take out 9 and 2, and return them back along with abs(9-2)=7.
Now we have 7 in the box, and the answer is therefore POSSIBLE.

Sample Input 2

3 5
6 9 3

Sample Output 2

IMPOSSIBLE

No matter what we do, it is not possible to have 5 in the box. The answer is therefore IMPOSSIBLE.

Sample Input 3

4 11
11 3 7 15

Sample Output 3

POSSIBLE

The box already contains 11 before we do anything. The answer is therefore POSSIBLE.

Sample Input 4

5 12
10 2 8 6 4

Sample Output 4

IMPOSSIBLE

Solution in Rust (1.42.0) (judge verdict: Time Limit Exceeded)

use proconio::{input, fastout};
use std::collections::{HashMap, HashSet};

macro_rules! echo {
  ($val:expr) => {
    println!("{}", $val);
  }
}

fn prime_factorization(mut x: usize) -> HashMap<usize, usize> {
  let mut map = HashMap::new();
  if x % 2 == 0 {
   while x % 2 == 0 {
     *map.entry(2).or_insert(0) += 1; 
     x /= 2;
   }
  }
  for d in (3..).step_by(2) {
    if x == 1 {
      break;
    }
    if x < d * d {
      map.entry(x).or_insert(1);
      break;
    }
    while x % d == 0 {
      *map.entry(d).or_insert(0) += 1; 
      x /= d;
    }
  }
  map
}

#[fastout]
fn main() {
  input!{
    n: usize,
    k: usize,
    aa: [usize; n]
  };
  let mut aa = aa;
  aa.sort();
  let mut set = HashSet::new();
  for &a in &aa {
    if a < k {
      continue
    } else if a == k {
      echo!("POSSIBLE");
      return;
    } else {
      for p in prime_factorization(a - k) {
        set.insert(p.0);
      }
    }
  }
  set.insert(1);
  dbg!(&set);
  let mut set2 = HashSet::new();
  // let a = aa[0];
  // if set.contains(&a) {
  //   echo!("POSSIBLE");
  //   return;
  // }
  // set2.insert(1);
  for i in 0..n {
    let a = aa[i];
    if set.contains(&a) {
      echo!("POSSIBLE");
      return;
    }
    let mut v = Vec::new();
    for &s in &set2 {
      let t = aa[i] % s;
      if set.contains(&t) {
        echo!("POSSIBLE");
        return;
      }
      if t != 0 {
        v.push(t);
      }
    }
    set2.insert(a);
    for v in v {
      set2.insert(v);
    }
  }
  echo!("IMPOSSIBLE");
}