#include <fstream>
#include <algorithm>
#include <deque>
#include <cstring>

#define DIM 205
#define DIMG 75005
#define INF 2000000000
#define infile "ghiozdan.in"
#define outfile "ghiozdan.out"

using namespace std;

ifstream fin(infile);
ofstream fout(outfile);

deque<int> deq;

int dp[2][DIMG];

int f[DIM];

int cnt = 0;

int T[2][DIMG];

void solve(int left, int right, int gMax) {

    ++cnt;

    if (left == right) {

        if (!f[left])
            return;

        for (int i = 1; i <= gMax / left; ++i)
            fout << left << '\n';

        return;

    }

    int middle = (left + right) / 2;

    int OLD = 0, NEW = 1, jMax = 0;

    for (int i = 0; i <= gMax; ++i) {

        dp[OLD][i] = (((i % left) || (i / left > f[left])) ? INF : i / left);

        T[OLD][i] = (dp[OLD][i] == INF ? 0 : i);

        if (dp[OLD][i] != INF)
            jMax = max(jMax, i);

    }

    for (int i = left + 1; i <= right; ++i) {

        if (f[i] == 0)
            continue;

        for (int j = 0; j <= gMax; ++j)
            dp[NEW][j] = INF;

        for (int mod = 0; mod < i; ++mod) {

            deq.clear();

            for (int j = mod; j <= gMax; j += i) {

                while (!deq.empty() && dp[OLD][deq.back()] + (j - deq.back()) / i >= dp[OLD][j])
                    deq.pop_back();

                deq.push_back(j);

                if ((j - deq.front()) / i > f[i])
                    deq.pop_front();

                dp[NEW][j] = min(INF, dp[OLD][deq.front()] + (j - deq.front()) / i);

                T[NEW][j] = (i <= middle ? j : T[OLD][deq.front()]);

                if (dp[NEW][j] != INF)
                    jMax = max(j, jMax);

            }

        }

        OLD ^= 1;
        NEW ^= 1;

    }

    if (cnt == 1) {

        fout << jMax << ' ' << dp[OLD][jMax] << '\n';

    }

    solve(left, middle, T[OLD][jMax]);

    solve(middle + 1, right, jMax - T[OLD][jMax]);

}

int main() {

    int n, gMax;

    fin >> n >> gMax;

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

        int x;

        fin >> x;

        ++f[x];

    }

    solve(1, 200, gMax);

    return 0;
}

//Trust me, I'm the Doctor!
//Miriam e tare!