#include<iostream>
using namespace std;
long long x[10000], n, q;
int main() {
	cin >> n >> q; if (n > 100 || q > 100)return 0; x[0] = 2000000000000;
	for (int i = 0; i < q; i++) {
		long long a, b, t = 0;
		cin >> a >> b;
		bool flag = false;
		for (int j = a; j >= 1; j--) {
			t += (x[j - 1] - x[j])*(a - j + 1);
			if (t >= b) {
				t -= (x[j - 1] - x[j])*(a - j + 1);
				for (int k = j + 1; k <= a; k++)x[k] = x[j];
				long long u = b - t;
				long long v1 = u / (a - j + 1), v2 = u % (a - j + 1);
				for (int k = j; k < j + v2; k++)x[k] += (v1 + 1);
				for (int k = j + v2; k <= a; k++)x[k] += v1;
				flag = true;
				break;
			}
		}
	}
	for (int i = 1; i <= n; i++)cout << x[i] << endl;
	return 0;
}