#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
	for (auto &i : v) is >> i;
	return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
	const string delimiter = "\n";
	REP(i, v.size())
	{
		os << v[i];
		if (i != v.size() - 1) os << delimiter;
	}
	return os;
}
/*--------------------template--------------------*/

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	int n, m;
	cin >> n >> m;
	vector<pii> v, range(n);
	REP(i, n) range[i] = pii(i, i);
	REP(i, m)
	{
		int a, b; cin >> a >> b;
		v.emplace_back(a, b-1);
	}
	sort(ALL(v));
	for (auto p : v)
	{
		int t = p.second;
		range[t] = range[t + 1] = pii(range[t].first, range[t + 1].second);
	}
	REP(i, range.size())
	{
		cout << range[i].second - range[i].first + 1 << (i == range.size() - 1 ? "\n" : " ");
	}
	return 0;
}
