#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define x first
#define y second 
#define all(x) x.begin(), x.end()
#define N 200005
using namespace std;
int n, m, s;
vector<pii> edge;
struct BIT{
    int arr[N];
    void modify(int x, int c){
        for (; x < N; x += (x & -x))
            arr[x] += c;
    }
    int query(int x){
        int ans = 0;
        for (; x > 0; x -= (x & -x))
            ans += arr[x];
        return ans;
    }
}bit;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> s;
    for (int i = 1; i <= m; i++){
        int a, b; cin >> a >> b;
        edge.emplace_back(a, b);
    }
    sort(all(edge)), reverse(all(edge));
    for (int i = 1; i <= n; i++){
        int d = min(abs(i - s), n - abs(s - i));
        bit.modify(i, d), bit.modify(i + 1, -d);
    }
    // cerr << "OK\n";
    // for (int i = 1; i <= n; i++)
    //     cerr << bit.query(i) << " \n"[i == n];
    for (auto [_, u]: edge){
        int v = (u == n) ? 1 : u + 1;
        int c1 = bit.query(u), c2 = bit.query(v);
        int c0 = (u == 1) ? bit.query(n) : bit.query(u - 1), c3 = (v == n) ? bit.query(1) : bit.query(v + 1);
        // cerr << u << " " << v << " " << c1 << " " << c2 << '\n';
        assert(abs(c1 - c2) <= 1);
        bit.modify(u, c2 - c1 - (c2 == c0 + 2)), bit.modify(u + 1, c1 - c2 + (c2 == c0 + 2));
        bit.modify(v, c1 - c2 - (c1 == c3 + 2)), bit.modify(v + 1, c2 - c1 + (c1 == c3 + 2));
        if (bit.query(1) - bit.query(u) == u || (u == 1 && bit.query(n) - bit.query(1) == 2)){
            int l = v, r = n + 1, c = bit.query(n);
            while (l < r){
                int mid = (l + r) >> 1;
                if (bit.query(mid) - c == n - mid)
                    r = mid;
                else l = mid + 1;
            }
            bit.modify(1, -1), bit.modify(u, 1);
            bit.modify(l, -1), bit.modify(n + 1, 1);
            // cerr << "go left1 " << l << '\n';
        }
        else {
            int l = 1, r = u, c = bit.query(u);
            while (l < r){
                int mid = (l + r) >> 1;
                if (bit.query(mid) - c == u - mid + 1)
                    r = mid;
                else l = mid + 1;
            }
            bit.modify(l, -1), bit.modify(u, 1);
            // cerr << "go left2 " << l << "\n";
        }
        if (bit.query(n) - bit.query(v) == n - v + 1 || (v == n && bit.query(1) - bit.query(n) == 2)){
            int l = 1, r = u + 1, c = bit.query(1);
            while (l < r){
                int mid = (l + r) >> 1;
                if (bit.query(mid) - c == mid - 1)
                    l = mid + 1;
                else r = mid;
            }
            // cerr << "go right1 " << l << " " << c << '\n';
            bit.modify(v + 1, -1), bit.modify(n + 1, 1);
            bit.modify(1, -1), bit.modify(l, 1);
        }
        else {
            int l = v + 1, r = n + 1, c = bit.query(v);
            while (l < r){
                int mid = (l + r) >> 1;
                if (bit.query(mid) - c == mid - v + 1)
                    l = mid + 1;
                else r = mid;
            }
            bit.modify(v + 1, -1), bit.modify(l, 1);
            // cerr << "go right2 " << l << "\n";
        }
        // for (int i = 1; i <= n; i++)
        //     cerr << bit.query(i) << " \n"[i == n];
    }
    for (int i = 1; i <= n; i++)
        cout << bit.query(i) << "\n";
    
    return 0;
}
/*
8 16 5
1 8
2 7
3 6
4 5
5 4
6 3
7 2
8 1
9 8
10 7
11 6
12 5
13 4
14 3
15 2
16 1

7 5 6
2 1
4 3
6 3
8 7
10 5
*/