#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(auto i=0LL; i<(long long)(n); i++)
#define repr(i,n) for(auto i=(long long)(n)-1LL; i>=0LL; i--)
using namespace std;

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    i64 N, M; cin >> N >> M;
    vector<i64> X(N+3);
    vector<i64> C(N+3);
    rep(i,M){
        i64 p,q; cin >> p >> q; p--;
        i64 l = max<i64>(0, p-q+1);
        i64 r = min<i64>(N, p+q);

        i64 h1 = q - p;
        X[l] += 1;
        C[l] += h1;
        X[p] -= 1;
        C[p] -= h1;

        i64 h2 = q + p;
        X[p] -= 1;
        C[p] += h2;
        X[r] += 1;
        C[r] -= h2;
    }
    rep(i,N+2) X[i+1] += X[i];
    rep(i,N+2) C[i+1] += C[i];
    rep(i,N){
        if(i) cout << ' ';
        cout << (X[i] * i + C[i]);
    } cout << '\n';
    return 0;
}