#include <bits/stdc++.h>
using namespace std;
#define LL long long
struct op {
    int x, y;
    bool operator<(const op &aa)const {
        return x < aa.x || x == aa.x && y > aa.y;
    }
} a[1000005];
int s, d, c[305];
LL b[1000005], dp[305][50005];
const int dd = 300;
template<typename T>inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();

    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-')
            w = -1;

        ch = getchar();
    }

    while (isdigit(ch) && ch != EOF)
        n = (n << 1) + (n << 3) + (ch & 15), ch = getchar();

    n *= w;
}
LL gt(int x, int y) {
    return b[min(y + c[x - 1], c[x])] - b[c[x - 1]];
}
void wk(int x, int y, int o, int i, int z, int p) {
    if (x > y)
        return;

    int mid = (x + y) >> 1;
    LL kk = -1;
    int k1;

    for (int g = o; g <= i && g <= mid; g++) {
        LL k2 = dp[z - 1][g * z + p] + gt(z, mid - g);

        if (k2 > kk)
            kk = k2, k1 = g;
    }

    dp[z][mid * z + p] = kk,
                         wk(x, mid - 1, o, k1, z, p), wk(mid + 1, y, k1, i, z, p);
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    read(s), read(d);

    for (int g = 1; g <= s; g++)
        read(a[g].x), read(a[g].y);

    sort(a + 1, a + 1 + s);

    for (int g = 1; g <= s; g++)
        b[g] = b[g - 1] + a[g].y, c[a[g].x] = g;

    for (int g = 1; g <= dd; g++)
        c[g] = max(c[g], c[g - 1]);

    for (int g = 1; g <= dd; g++)
        for (int h = 0; h < g; h++)
            wk(0, (d - h) / g, 0, (d - h) / g, g, h);

    for (int g = 1; g <= d; g++)
        cout << dp[dd][g] << ' ';

    return 0;
}