#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>

#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <limits>
#include <numeric>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v)
    is >> x;
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  if (!v.empty()) {
    os << v.front();
    for (int i = 1; i < v.size(); ++i)
      os << ' ' << v[i];
  }
  return os;
}

int main() {
#ifdef ELEGIA
  freopen("test.in", "r", stdin);
  int nol_cl = clock();
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, m, s;
  cin >> n >> m >> s;
  --s;
  vector<int> f(n), vis(n);
  iota(f.begin(), f.end(), 0);
  function<int(int)> find = [&](int x) { return f[x] == x ? x : f[x] = find(f[x]); };
  ll basic = 0;
  while (m--) {
    int u, v;
    cin >> u >> v;
    --u; --v;
    basic += abs(u - v);
    ++vis[u]; ++vis[v];
    u = find(u);
    v = find(v);
    f[u] = v;
  }
  auto solve = [&]() {
    ll ret = basic;
    auto f2 = f;
    function<int(int)> find2 = [&](int x) { return f2[x] == x ? x : f2[x] = find2(f2[x]); };
    int cur = -1;
    for (int j = 0; j < n; ++j) {
      if (vis[j] & 1) {
        if (cur == -1)
          cur = j;
        else {
          ret += j - cur;
          for (int k = cur; k < j; ++k) {
            int x = find2(k), y = find2(k + 1);
            f2[x] = y;
          }
          cur = -1;
        }
      }
    }
    cur = -1;
    vector<pair<int, pair<int, int>>> edges;
    for (int j = 0; j < n; ++j)
      if (vis[j]) {
        if (cur != -1)
          edges.emplace_back(j - cur, make_pair(cur, j));
        cur = j;
      }
    sort(edges.begin(), edges.end());
    for (int i = 0; i < edges.size(); ++i) {
      int x, y;
      tie(x, y) = edges[i].second;
      x = find2(x);
      y = find2(y);
      if (x != y) {
        f2[x] = y;
        ret += edges[i].first * 2;
      }
    }
    return ret;
  };
  vector<ll> ans(n);
  ++vis[s];
  for (int i = 0; i < n; ++i) {
    ++vis[i];
    ans[i] = solve();
    --vis[i];
  }
  cout << ans << '\n';

#ifdef ELEGIA
  LOG("Time: %dms\n", int ((clock()
          -nol_cl) / (double)CLOCKS_PER_SEC * 1000));
#endif
  return 0;
}