#include <bits/stdc++.h>
#define maxn 100010
#define getV(p) (p?p->v:1000000000)
using namespace std;

int n, m;
int l[maxn], r[maxn];
vector<int> Len[maxn];
struct Node{ int l, r, v; Node *ls, *rs; };
struct node{
	int l, r;
	Node *root;
	node *ls, *rs;
}*rt;

Node* newNode(int l, int r)
{
	Node *rt = new Node;
	rt->l = l, rt->r = r, rt->ls = rt->rs = NULL;
	rt->v = 1e9;
	return rt;
}
node* newnode(int l, int r)
{
	node *rt = new node;
	rt->l = l, rt->r = r, rt->ls = rt->rs = NULL;
	rt->root = NULL;
	return rt;
}

void insert(Node *&rt, int l, int r, int x, int v)
{
	if (!rt) rt = newNode(l, r);
	rt->v = min(rt->v, v);
	if (l == r) return;
	int mid = l + r >> 1;
	if (x <= mid) insert(rt->ls, l, mid, x, v);
	else insert(rt->rs, mid + 1, r, x, v);
}
void Insert(node *&rt, int l, int r, int L, int R, int v)
{
	if (!rt) rt = newnode(l, r);
	insert(rt->root, 1, n, R, v);
	if (l == r) return;
	int mid = l + r >> 1;
	if (L <= mid) Insert(rt->ls, l, mid, L, R, v);
	else Insert(rt->rs, mid + 1, r, L, R, v);
}
int query(Node *rt, int l, int r)
{
	if (!rt) return 1e9;
	if (l <= rt->l && r >= rt->r) return rt->v;
	int mid = rt->l + rt->r >> 1, res = 1e9;
	if (l <= mid) res = min(res, query(rt->ls, l, r));
	if (r > mid) res = min(res, query(rt->rs, l, r));
	return res;
}
int Query(node *rt, int l, int r, int ll, int rr)
{
	if (!rt) return 1e9;
	if (l <= rt->l && r >= rt->r) return query(rt->root, ll, rr);
	int mid = rt->l + rt->r >> 1, res = 1e9;
	if (l <= mid) res = min(res, Query(rt->ls, l, r, ll, rr));
	if (r > mid) res = min(res, Query(rt->rs, l, r, ll, rr));
	return res;
}

int solve(int L, int R)
{
	if (L > R) return 0;
	int v = Query(rt, L, n, 1, R);
	//cerr << v << endl;
	if (v == 1e9) return 0;
	return r[v] - l[v] + 1 + solve(L, l[v] - 1) + solve(r[v] + 1, R);
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i ++ ) scanf("%d%d", &l[i], &r[i]), Len[r[i] - l[i] + 1].push_back(i);
	
	vector<int> ans(n + 1);
	for (int i = n; i; i -- )
	{
		for (auto j : Len[i]) Insert(rt, 1, n, l[j], r[j], j);
		ans[i] = solve(1, n);
	}
	
	for (int i = 1; i <= n; i ++ ) printf("%d\n", ans[i]);
	
	return 0;
}