Problem: After playing with her beautiful array, Mishka decided to learn some math. After learning how to multiply, divide and what is divisibility, she is now interested in solving the following problem.

You are given integer k and array a1, a2, ..., an of n integers. You are to find non-empty subsequence of array elements such that the product of its elements is divisible by k and it contains minimum possible number of elements.

Formally, you are to find a sequence of indices 1 ≤ i1 < i2 < ... < im ≤ n such that <image> is divisible by k while m is minimum possible among all such variants.

If there are more than one such subsequences, you should choose one among them, such that sum of its elements is minimum possible.

Mishka quickly solved this problem. Will you do so?

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 1 000, 1 ≤ k ≤ 1012).

The second line of the input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1012) — array elements.

Output

Print single positive integer m in the first line — the number of elements in desired sequence.

In the second line print m distinct integers — the sequence of indices of given array elements, which should be taken into the desired sequence. 

If there are more than one such subsequence (e.g. subsequence of minimum possible number of elements and with minimum possible sum of elements), you can print any of them.

If there are no such subsequences, print  - 1 in the only line.

Example

Input

5 60
2 4 6 5 2


Output

3
4 3 1 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return a > val ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
const int MAXN = 654321;
const int NOTFOUND = -1;
struct HashMap {
  int cur, head[MAXN], next[MAXN];
  long long l[MAXN];
  int x[MAXN];
  HashMap() {
    cur = 0;
    fill_n(head, MAXN, 0);
    fill_n(next, MAXN, 0);
  }
  int find(long long key) {
    for (int i = head[key % MAXN]; i; i = next[i]) {
      if (l[i] == key) {
        return x[i];
      }
    }
    return NOTFOUND;
  }
  void insert(long long key, int val) {
    if (find(key) != NOTFOUND) return;
    l[++cur] = key;
    x[cur] = val;
    next[cur] = head[key % MAXN];
    head[key % MAXN] = cur;
  }
} hs;
const int maxn = 1000 + 10;
const int maxd = 7000 + 10;
int n;
long long k;
long long a[maxn];
vector<long long> dvs;
pair<int, long long> f[maxn][maxd];
int r[maxn][maxd];
void solve() {
  cin >> n >> k;
  for (int i = 1; (long long)i * i <= k; i++) {
    if (k % i == 0) {
      dvs.push_back(i);
      if (i < k / i) {
        dvs.push_back(k / i);
      }
    }
  }
  sort((dvs).begin(), (dvs).end());
  for (int i = (0); i < (int((dvs).size())); i++) {
    hs.insert(dvs[i], i);
  }
  for (int i = (0); i < (n); i++) cin >> a[i];
  if (k == 1) {
    cout << 1 << "\n";
    int best = 0;
    for (int i = (1); i < (n); i++)
      if (a[best] > a[i]) best = i;
    cout << best + 1 << "\n";
    return;
  }
  for (int i = (0); i < (n + 1); i++)
    for (int j = (1); j < (int((dvs).size())); j++) f[i][j] = make_pair(INF, 0);
  for (int pos = (n)-1; pos >= (0); pos--)
    for (int i = (1); i < (int((dvs).size())); i++) {
      f[pos][i] = f[pos + 1][i];
      int nxt = hs.find(dvs[i] / gcd(dvs[i], a[pos]));
      if (chkmin(f[pos][i], make_pair(f[pos + 1][nxt].first + 1,
                                      f[pos + 1][nxt].second + a[pos]))) {
        r[pos][i] = 1;
      }
    }
  int ans = f[0][int((dvs).size()) - 1].first;
  if (ans > n) {
    cout << -1 << "\n";
    return;
  }
  cout << ans << "\n";
  int cur = 0;
  k = int((dvs).size()) - 1;
  while (cur < n) {
    if (r[cur][k]) {
      cout << cur + 1 << " ";
      k = hs.find(dvs[k] / gcd(dvs[k], a[cur]));
    }
    cur++;
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}