#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	int n, m, s;
	cin >> n >> m >> s;
	--s;

	pii c[m];
	for (auto &[x, y] : c) cin >> x >> y, --y;
	sort(c, c + m);

	int a[n] = {};
	for (int i = 0; i < n; i++) a[i] = 1e9;
	for (int i = 0; i < n; i++) {
		a[(s + i) % n] = min(a[(s + i) % n], i);
		a[(s + n - i) % n] = min(a[(s + n - i) % n], i);
	}
	
	int b[n] = {};
	for (int i = 0; i < n; i++) {
		b[i] = a[(i + 1) % n] - a[i];
	}

	set<int> S[3];
	for (int i = 0; i < n; i++) S[b[i] + 1].insert(i);

	for (int i = m; i > 0; i--) {
		int p = c[i - 1].ss;

		if (s == p) s = (p + 1) % n;
		else if (s == (p + 1) % n) s = p;

		if (b[p] == 0) continue;
		if (b[p] == 1) {
			int pos = 1e9;
			for (int t : {0, 1}) {
				if (S[t].empty()) continue;
				auto it = S[t].lower_bound(p);
				int k = it == S[t].end() ? n + *S[t].begin() : *it;

				pos = min(pos, k);
			}
			pos %= n;

			S[b[pos] + 1].erase(pos);
			b[pos] += 1;
			S[b[pos] + 1].insert(pos);

			int q = (p + n - 1) % n;
			if (b[q] == 1) {
				S[b[p] + 1].erase(p);
				b[p] -= 1;
				S[b[p] + 1].insert(p);
			}
			else {
				S[b[q] + 1].erase(q);
				b[q] += 1;
				S[b[q] + 1].insert(q);
				
				S[b[p] + 1].erase(p);
				b[p] -= 2;
				S[b[p] + 1].insert(p);
			}
		}
		else {
			int pos = -1e9;
			for (int t : {1, 2}) {
				if (S[t].empty()) continue;
				auto it = S[t].upper_bound(p);
				int k = it == S[t].begin() ? *prev(S[t].end()) - n : *prev(it);

				pos = max(pos, k);
			}
			pos = (n + pos % n) % n;

			S[b[pos] + 1].erase(pos);
			b[pos] -= 1;
			S[b[pos] + 1].insert(pos);

			int q = (p + 1) % n;
			if (b[q] == -1) {
				S[b[p] + 1].erase(p);
				b[p] += 1;
				S[b[p] + 1].erase(p);
			}
			else {
				S[b[q] + 1].erase(q);
				b[q] -= 1;
				S[b[q] + 1].insert(q);

				S[b[p] + 1].erase(p);
				b[p] += 2;
				S[b[p] + 1].insert(p);
			}
		}
	}

	a[s] = 0;
	for (int i = 0; i < n; i++) {
		a[(s + i + 1) % n] = a[(s + i) % n] + b[(s + i) % n];
	}

	for (int i = 0; i < n; i++) {
		cout << a[i] << '\n';
	}
}