#include <bits/stdc++.h>
using namespace std;
int n, cnt;
long long t, k, a[1000 + 2], b[1000 + 2], division[7000 + 2];
pair<int, long long> f[1000 + 2][7000 + 2];
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
int main() {
  cin >> n >> k;
  t = k;
  for (register int i = 1; i <= n; i++)
    cin >> a[i], t /= gcd(a[i], t), b[i] = gcd(a[i], k);
  if (t != 1)
    puts("-1");
  else if (k == 1)
    cout << 1 << endl << min_element(a + 1, a + n + 1) - a << endl;
  else {
    for (register int i = 1; i * 1ll * i <= k; i++)
      if (k % i == 0) {
        division[++cnt] = i;
        if (k != i * 1ll * i) division[++cnt] = k / i;
      }
    sort(division + 1, division + cnt + 1);
    memset(f[0], 0x3f, sizeof(f[0]));
    f[0][1] = pair<int, long long>(0, 0);
    for (int i = 1; i <= n; i++)
      for (register int j = 1; j <= cnt; j++) {
        int d = lower_bound(division + 1, division + cnt + 1,
                            division[j] / gcd(division[j], b[i])) -
                division;
        if (f[i - 1][j] >
            make_pair(f[i - 1][d].first + 1, f[i - 1][d].second + a[i]))
          f[i][j] = make_pair(f[i - 1][d].first + 1, f[i - 1][d].second + a[i]);
        else
          f[i][j] = f[i - 1][j];
      }
    cout << f[n][cnt].first << endl;
    for (register int i = n, j = cnt; i; i--)
      if (f[i - 1][j] != f[i][j]) {
        j = lower_bound(division + 1, division + cnt + 1,
                        division[j] / gcd(division[j], b[i])) -
            division;
        cout << i << " ";
      }
  }
  return 0;
}
