#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
long long poww(long long a, long long b) {
  if (b == 0) return 1;
  long long x = poww(a, b / 2);
  x = x * x;
  if (b % 2 == 1) x = x * a;
  return x;
}
long long bigmod(long long a, long long b, long long c) {
  if (b == 0) return 1 % c;
  long long x = bigmod(a, b / 2, c);
  x = x * x % c;
  if (b % 2 == 1) x = x * a % c;
  return x;
}
long long mod_inverse(long long a, long long mod) {
  return bigmod(a, mod - 2, mod);
}
const int M = 1000005;
int frq[M], dp[M], a[M];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < (n); i++) {
    cin >> a[i];
    if (a[i] > m) continue;
    frq[a[i]]++;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = i; j <= m; j += i) {
      dp[j] += frq[i];
    }
  }
  int mx = 0, lcm = 1;
  for (int i = 1; i <= m; i++) {
    if (dp[i] > mx) {
      mx = dp[i];
      lcm = i;
    }
  }
  cout << lcm << " " << mx << endl;
  for (int i = 0; i < (n); i++) {
    if (lcm % a[i] == 0) cout << i + 1 << " ";
  }
  cout << endl;
  return 0;
}
