1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
#define re register
const int MAXn = 5e5;
const int MAXm = 1e5;
const int MAXedge = 3e7;

template <class T> 
inline void read(T &a) {
    register char c;while (c = getchar(), c < '0' || c > '9');register T x(c - '0');while (c = getchar(), c >= '0' && c <= '9') {x = (x << 1) + (x << 3) + (c ^ 48);}a = x;  
}

int head[MAXn * 11 + 10], cntnex, nex[MAXedge + 10], to[MAXedge + 10]; bool wei[MAXedge + 10];
void Insert(int u, int v, int w) {
    nex[++cntnex] = head[u];
    head[u] = cntnex;
    to[cntnex] = v;
    wei[cntnex] = w;
}

int n, m, root;
struct Node{
    int l, r, idx;
}out[MAXn * 4 + 10], in[MAXn * 4 + 10];
int cntnd;
void BuildOut(int id, int l, int r) {
    out[id].idx = ++cntnd;
    out[id].l = l;
    out[id].r = r;
    if (l == r) {
        Insert(l, out[id].idx, 0);
        return;
    }
    int mid = (l + r) >> 1;
    BuildOut(id << 1, l, mid);
    BuildOut((id << 1) + 1, mid + 1, r);
    Insert(out[id << 1].idx, out[id].idx, 0);
    Insert(out[(id << 1) + 1].idx, out[id].idx, 0);
}
void BuildIn(int id, int l, int r) {
    in[id].idx = ++cntnd;
    in[id].l = l;
    in[id].r = r;
    if (l == r) {
        Insert(in[id].idx, 10 * n + l, 0);
        return;
    }
    int mid = (l + r) >> 1;
    BuildIn(id << 1, l, mid);
    BuildIn((id << 1) + 1, mid + 1, r);
    Insert(in[id].idx, in[id << 1].idx, 0);
    Insert(in[id].idx, in[(id << 1) + 1].idx, 0);
}
int cntqin, qin[MAXn + 10], cntqout, qout[MAXn + 10];
void GetSecIn(int id, int l, int r) {
    if (in[id].l >= l && in[id].r <= r) {
        qin[++cntqin] = in[id].idx;
        return;
    }
    int mid = (in[id].l + in[id].r) >> 1;
    if (mid >= l) {
        GetSecIn(id << 1, l, r);
    }
    if (mid + 1 <= r) {
        GetSecIn((id << 1) + 1, l, r);
    }
}
void GetSecOut(int id, int l, int r) {
    if (out[id].l >= l && out[id].r <= r) {
        qout[++cntqout] = out[id].idx;
        return;
    }
    int mid = (out[id].l + out[id].r) >> 1;
    if (mid >= l) {
        GetSecOut(id << 1, l, r);
    }
    if (mid + 1 <= r) {
        GetSecOut((id << 1) + 1, l, r);
    }
}
void InsertSec(int l1, int r1, int l2, int r2) {
    cntqin = cntqout = 0;
    GetSecOut(1, l2, r2);
    GetSecIn(1, l1, r1);
    for (re int i = 1; i <= cntqout; ++i) {
        for (re int j = 1; j <= cntqin; ++j) {
            Insert(qout[i], qin[j], 1);
        }
    }
}

bool vis[MAXn * 11 + 10]; int dis[MAXn * 11 + 10];
priority_queue<pair<int, int> > q;
void Dijkstra(int root) {
    memset(dis, 0x3f, sizeof(dis));
    dis[root] = 0;
    q.push(make_pair(0, root));
    while (!q.empty()) {
        int cur = q.top().second; q.pop();
        if (vis[cur]) continue;
        vis[cur] = 1;
        for (re int i = head[cur]; i; i = nex[i]) {
            if (dis[to[i]] > dis[cur] + wei[i]) {
                dis[to[i]] = dis[cur] + wei[i];
                q.push(make_pair(-dis[to[i]], to[i]));
            }
        }
    }
}

int main() {
    read(n), read(m), read(root);
    cntnd = n;
    BuildOut(1, 1, n);
    BuildIn(1, 1, n);
    for (re int i = 1, l1, r1, l2, r2; i <= m; ++i) {
        read(l1), read(r1), read(l2), read(r2);
        InsertSec(l1, r1, l2, r2);
        InsertSec(l2, r2, l1, r1);
    }
    for (re int i = 1; i <= n; ++i) {
        Insert(i, 10 * n + i, 0);
        Insert(10 * n + i, i, 0);
    }
    Dijkstra(root);
    for (re int i = 10 * n + 1; i <= 11 * n; ++i) {
        printf("%d\n", dis[i]);
    }
}