#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 

int n, m, s, sum; 
struct edge {
    int u, v, w;
    edge(int u = 0, int v = 0, int w = 0) : u(u), v(v), w(w) {}
    bool operator< (const edge &a) const { return w < a.w; }
};
int fa[2505], bel[2505], deg[2505];
void init(void) { for (int i = 1; i <= n; ++i) fa[i] = i; }
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> m >> s; init(); 
    for (int i = 1; i <= m; ++i) {
        int u, v; cin >> u >> v; sum += abs(u - v); 
        ++deg[u], ++deg[v]; fa[find(u)] = find(v); 
    }
    for (int i = 1; i <= n; ++i) bel[i] = find(i); 
    for (int t = 1; t <= n; ++t) {
        init(); ++deg[s]; ++deg[t]; 
        fa[find(bel[s])] = find(bel[t]); 
        i64 ans = sum, pre = 0; 
        for (int i = 1; i <= n; ++i) if (deg[i] & 1) {
            if (pre) {
                ans += i - pre;
                for (int k = pre; k < i; k++)
                    fa[find(bel[k])] = fa[find(bel[i])];
                pre = 0;
            }
            else pre = i;
        }
        vector<edge> a;
        for (int i = 1; i <= n; ++i) if (deg[i]) {
            if (pre && find(bel[i]) != find(bel[pre]))
                a.emplace_back(bel[i], bel[pre], abs(i - pre));
            pre = i;
        }
        sort(a.begin(), a.end()); 
        for (int sz = a.size(), i = 0; i < sz; ++i)
            if (find(a[i].u) != find(a[i].v)) 
                fa[find(a[i].u)] = find(a[i].v), ans += a[i].w * 2;
        cout << ans << " \n"[t == n]; --deg[s]; --deg[t]; 
    }
    return 0;
}