#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, int> > pk;
vector<int> pa[1005];
long long a[1005];
pair<int, long long> dp[1005][7005];
int pre[1005][7005];
inline int encode(vector<int>& v) {
  int res = 0;
  for (int i = 0; i < (int)pk.size(); ++i) {
    res = res * (pk[i].second + 1) + v[i];
  }
  return res;
}
inline void decode(int st, vector<int>& v) {
  v.resize(pk.size());
  for (int i = (int)pk.size() - 1; i >= 0; --i) {
    int x = st % (pk[i].second + 1);
    v[i] = x;
    st /= pk[i].second + 1;
  }
}
int main() {
  int d = 1;
  int n;
  long long k;
  scanf("%d%lld", &n, &k);
  long long kk = k;
  for (int i = 2; 1LL * i * i <= k; ++i) {
    if (k % i == 0) {
      int num = 0;
      while (k % i == 0) k /= i, ++num;
      pk.push_back(make_pair(i, num));
      d *= num + 1;
    }
  }
  if (k != 1) pk.push_back(make_pair(k, 1)), d *= 2;
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", a + i);
    long long t = a[i];
    for (int j = 0; j < (int)pk.size(); ++j) {
      int num = 0;
      while (t % pk[j].first == 0) t /= pk[j].first, ++num;
      pa[i].push_back(num);
    }
  }
  if (kk == 1) {
    long long mi = 1LL << 50;
    int pos;
    for (int i = 1; i <= n; ++i)
      if (mi > a[i]) mi = a[i], pos = i;
    printf("1\n%d\n", pos);
    return 0;
  }
  for (int i = 0; i <= n; ++i)
    for (int j = 0; j < d; ++j) dp[i][j] = make_pair(100000, 1);
  vector<int> v;
  dp[0][0] = make_pair(0, 0);
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < d; ++j) {
      dp[i][j] = dp[i - 1][j], pre[i][j] = j;
      decode(j, v);
      for (int k = 0; k < (int)pk.size(); ++k) v[k] -= min(v[k], pa[i][k]);
      int st = encode(v);
      if (dp[i][j] >
          make_pair(dp[i - 1][st].first + 1, dp[i - 1][st].second + a[i])) {
        dp[i][j] =
            make_pair(dp[i - 1][st].first + 1, dp[i - 1][st].second + a[i]);
        pre[i][j] = st;
      }
    }
  }
  if (dp[n][d - 1].first == 100000) return 0 * puts("-1");
  vector<int> ans;
  for (int i = n, now = d - 1; i >= 1; --i) {
    if (pre[i][now] != now) ans.push_back(i);
    now = pre[i][now];
  }
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < (int)ans.size(); ++i) {
    if (i) putchar(' ');
    printf("%d", ans[i]);
  }
  puts("");
  return 0;
}
