#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep1(a) for(int i = 0; i < a; i++) #define rep2(i, a) for(int i = 0; i < a; i++) #define rep3(i, a, b) for(int i = a; i < b; i++) #define rep4(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(a) for(int i = (a)-1; i >= 0; i--) #define rrep2(i, a) for(int i = (a)-1; i >= 0; i--) #define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--) #define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; using vi = vector; using vl = vector; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__VA_ARGS__)))) template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } template< class T, T (*id)(), void(*com)(T&, const T&) > struct dual_segtree { int sz; vector< T > dat; dual_segtree(int n){ sz = 1; while(sz < n) sz <<= 1; dat.assign(2*sz, id()); } void apply(int l, int r, const T &t){ if(l > r or l >= sz or r <= 0) return; l += sz; r += sz; for(;l>=1,r>>=1){ if(l&1) com(dat[l++], t); if(r&1) com(dat[--r], t); } } T get(int i) const{ T res = id(); i += sz; for(;i;i>>=1){ com(res, dat[i]); } return res; } }; using T = ll; T id() {return 0;} void com(T &a, const T &b) {a += b;} int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n,m; in(n,m); dual_segtree st(n); while(m--){ int p,q; in(p,q); p--; int left = max(0,p-q); int right = min(n-1, p+q); int v = q-(p-left); st.apply(left, left+1, v); st.apply(left+1, p+1, 1); st.apply(p+1, right+1, -1); } ll res = 0; rep(i,n){ res += st.get(i); outr(res," \n"[i==n-1]); } }