#include <bits/stdc++.h>
using namespace std;
int n; array<int, 2> t[800007]; const int I = 0x3f3f3f3f;
inline void Cmin(int &x, int y) { x = min(x, y); }
inline void Upd(int x, int w0, int w1) { Cmin(t[x][0], w0), Cmin(t[x][1], w1); }
inline void Pdn(int x) { auto &[u, v] = t[x];
    Upd(x << 1, u, v), Upd(x << 1 | 1, u, v), u = v = I; }
void Chg(int x, int p, int v, int L, int R) {
    if(L == R) return t[x] = {v - p, v + p}, void();
    const int M = (L + R) >> 1; Pdn(x);
    if(p <= M) Chg(x << 1, p, v, L, M), Upd(x << 1 | 1, v - p, n + v + p);
    else Chg(x << 1 | 1, p, v, M + 1, R), Upd(x << 1, n + v - p, v + p);
}
int Ask(int x, int p, int L, int R) {
    if(L == R) return min(t[x][0] + p, t[x][1] - p);
    const int M = (L + R) >> 1; Pdn(x);
    return p <= M ? Ask(x << 1, p, L, M) : Ask(x << 1 | 1, p, M + 1, R);
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int m, s; cin >> n >> m >> s;
    fill(t, t + n * 4, array<int, 2>({I, I}));
    vector<pair<int, int>> bdg;
    for(int i = 0, d, x; i < m; ++i)
        cin >> d >> x, bdg.emplace_back(d, x);
    sort(bdg.begin(), bdg.end());
    reverse(bdg.begin(), bdg.end()), Chg(1, s, 0, 1, n);
    const auto &nxt = [&](int i) { return i == n ? 1 : i + 1; };
    const auto &lst = [&](int i) { return i == 1 ? n : i - 1; };
    const auto &ask = [&](int i) { return Ask(1, i, 1, n); };
    const auto &print = [&](auto &&self, int x, int L, int R) -> void {
        if(L == R) printf("%d\n", min(t[x][0] + L, t[x][1] - L));
        else { const int M = (L + R) >> 1; Pdn(x);
            self(self, x << 1, L, M), self(self, x << 1 | 1, M + 1, R); }
    };
    for(const auto [_, i] : bdg) {
        const int j = nxt(i), p = ask(i), q = ask(j);
        Chg(1, i, min(q, ask(lst(i)) + 1), 1, n);
        Chg(1, j, min(p, ask(nxt(j)) + 1), 1, n);
    }
    print(print, 1, 1, n);
}