#include <bits/stdc++.h>
#define MAXN 100
#define MAXM ((int) 1e5)
#define INF ((long long) 1e18)
using namespace std;

int n, m, W[MAXN + 10], V[MAXN + 10];

long long f[MAXM + 10];
int g[MAXM + 10];

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) scanf("%d%d", &W[i], &V[i]);

    for (int i = 0; i <= m; i++) f[i] = -INF;
    f[0] = 0;
    for (int i = 1; i <= n; i++) for (int j = m; j >= W[i]; j--) f[j] = max(f[j], f[j - W[i]] + V[i]);

    g[0] = 0;
    for (int i = 1; i <= m; i++) {
        g[i] = g[i - 1];
        if (f[i] > f[g[i]]) g[i] = i;
    }
    for (int i = m - 1; i >= 0; i--) {
        long long delta = f[g[m]] - f[g[i]];
        printf("%lld\n", delta + 1);
    }
    return 0;
}