#include <iostream>

#include <vector>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include <map>

#include <set>

#include <string>

#include <queue>

#include <stack>

#include <bitset>

using namespace std;

#define pb(x) push_back(x)

#define ll long long

#define mk(x, y) make_pair(x, y)

#define lson l, m, rt<<1

#define mem(a) memset(a, 0, sizeof(a))

#define rson m+1, r, rt<<1|1

#define mem1(a) memset(a, -1, sizeof(a))

#define mem2(a) memset(a, 0x3f, sizeof(a))

#define rep(i, n, a) for(int i = a; i<n; i++)

#define fi first

#define se second

typedef pair<int, int> pll;

const double PI = acos(-1.0);

const double eps = 1e-;

const int mod = 1e9+;

const int inf = ;

const int dir[][] = { {-, }, {, }, {, -}, {, } };

int a[], cnt[], maxx, pos, flag;

int main()

{

    int n, m;

    cin>>n>>m;

    for(int i = ; i<=n; i++) {

        scanf("%d", &a[i]);

        if(a[i]<=m) {

            cnt[a[i]]++;

            flag = ;

        }

    }

    if(!flag) {

        puts("1 0");

        return ;

    }

    for(int i = m; i>=; i--) {

        for(int j = *i; j<=m; j+=i) {

            cnt[j] += cnt[i];

        }

    }

    for(int i = ; i<=m; i++) {

        if(cnt[i]>maxx) {

            maxx = cnt[i];

            pos = i;

        }

    }

    cout<<pos<<" "<<maxx<<endl;

    for(int i = ; i<=n; i++) {

        if(pos%a[i]==)

            printf("%d ", i);

    }

    return ;

}