#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int NMAX = 100005;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector <int> g[NMAX];
queue <int> q;
int dist[NMAX];

void bfs(int root, int n)
{
    q.emplace(root);
    dist[root] = 0;
    while(!q.empty()) {
        int curr = q.front();
        q.pop();
        for(auto x: g[curr]) {
            if(dist[x] == -1) {
                dist[x] = dist[curr] + 1;
                q.emplace(x);
            }
        }
    }
}

int main() {
    int n, m, x;
    cin >> n >> m >> x;
    for(int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        g[x].emplace_back(y);
    }
    for(int i = 1; i <= n; ++i)
        dist[i] = -1;
    bfs(x, n);
    for(int i = 1; i <= n; ++i) {
        cout << dist[i] << " ";
    }
    cout << "\n";
    return 0;
}