#include <string>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <iomanip>
#include <ctime>
#include <valarray>
#include <iostream>
#include <sstream>
#include <fstream>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;
int ans[N];
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int n, m;
	cin >> n >> m;
	while (n--)
	{
		int a, b;
		cin >> a >> b;
		ans[a] = max(ans[a], b);
	}
	for (int i = 1; i <= m; i++)
		ans[i] = max(ans[i], ans[i - 1] - 1);
	for (int i = m; i >= 1; i--)
		ans[i] = max(ans[i], ans[i + 1] - 1);
	for (int i = 1; i <= m; i++)
		printf("%d%c", ans[i], " \n"[i == m]);
	return 0;
}