#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

const int inf = 1e9;

struct SegTree {
  int n;
  vector<int> tree;
  
  SegTree(int n_) : n(n_), tree(2 * n, inf) {}
  
  int get(int L, int R) const {
    L += n;
    R += n;
    int ret = inf;
    while (L <= R) {
      if (L % 2 == 1) {
        ret = min(ret, tree[L++]);
      }
      if (R % 2 == 0) {
        ret = min(ret, tree[R--]);
      }
      L /= 2;
      R /= 2;
    }
    return ret;
  }
  
  void modify(int x, int v) {
    x += n;
    tree[x] = v;
    x /= 2;
    while (x > 0) {
      tree[x] = min(tree[2 * x], tree[2 * x + 1]);
      x /= 2;
    }
  }
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, st;
  cin >> n >> m >> st;
  --st;
  vector<pair<int, int>> b(m);
  for (auto& [d, t] : b) {
    cin >> d >> t;
    --t;
  }
  sort(b.rbegin(), b.rend());
  SegTree st0(2 * n), st1(2 * n);
  auto Get = [&](int i) {
    return min(st0.get(i, i + n) - i, st1.get(i, i + n) + (i + n));
  };
  auto Modify = [&](int i, int v) {
    st0.modify(i, v + i);
    st0.modify(i + n, v + (i + n));
    st1.modify(i, v - i);
    st1.modify(i + n, v - (i + n));
  };
  Modify(st, 0);
  for (auto [_, t] : b) {
    int u = (t + 1) % n;
    int s = (t - 1 + n) % n;
    int v = (u + 1) % n;
    int toS = Get(s);
    int toT = Get(t);
    int toU = Get(u);
    int toV = Get(v);
    // store the influence of t and u
    Modify(s, min(toS, toT + 1));
    Modify(v, min(toV, toU + 1));
    Modify(t, toU);
    Modify(u, toT);
  }
  for (int i = 0; i < n; i++) {
    cout << Get(i) << '\n';
  }
  return 0;
}