#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

const int N = 1e5 + 10;

int f[N];

int n, m, s;

int32_t main() {
  #define task ""

  cin.tie(0) -> sync_with_stdio(0);

  if (fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  if (fopen(task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  cin >> n >> m >> s;

  vector<pair<int, int> > e;

  while (m--) {
    int d, i; cin >> d >> i;
    d = -d;
    e.emplace_back(d, i);
  }

  sort(e.begin(), e.end());

  for(int i = 1; i <= n; i++) f[i] = 1e9;

  f[s] = 0;

  auto calc = [&] (int pos) {
    int ret = 1e9;
    for(int i = 1; i <= n; i++) {
      ret = min(ret, f[i] + min(n - abs(i - pos), abs(i - pos)));
    }
    return ret;
  };

  for(auto &[useless, i] : e) {
    int left = i > 1 ? i - 1 : n;
    int right = i + 2;
    if (right > n) right -= n;
    int x = i;
    int y = i + 1;
    if (y > n) y -= n;
    int tmpx = calc(x);
    int tmpy = calc(y);
    f[left] = min(f[left], f[x] + 1);
    f[right] = min(f[right], f[y] + 1);
    f[x] = tmpy;
    f[y] = tmpx;
  }
  for(int i = 1; i <= n; i++) cout << calc(i) << endl;
}