#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long f[305][50005], n, k, s[1000005];
vector <int> v[305], p;
bool cmp(int x, int y){
	return x > y;
}
void solve(int pos, int l, int r, int pl, int pr){
	if(l > r)
		return;
	int mid = (l + r) >> 1, opt = max(pl, mid - (int)v[pos].size());
	for(int i = opt + 1; i <= min(pr, mid); i++)
		if(f[pos - 1][p[opt]] + s[mid - opt] < f[pos - 1][p[i]] + s[mid - i])
			opt = i;
	f[pos][p[mid]] = f[pos - 1][p[opt]] + s[mid - opt];
	solve(pos, l, mid - 1, pl, opt);
	solve(pos, mid + 1, r, opt, pr);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k;
	for(int i = 1, x, y; i <= n; i++){
		cin >> x >> y;
		v[x].push_back(y);
	}
	for(int i = 1; i <= 300; i++){
		sort(v[i].begin(), v[i].end(), cmp);
		for(int j = 0; j < v[i].size(); j++)
			s[j + 1] = v[i][j] + s[j];
		for(int j = 0; j < i; j++){
			p.clear();
			for(int t = j; t <= k; t += i)
				p.push_back(t);
			solve(i, 0, (int)p.size() - 1, 0, (int)p.size() - 1);
		}
	}
	for(int i = 1; i <= k; i++)
		cout << f[300][i] << " ";
	return 0;
}