#include <bits/stdc++.h>

using namespace std;

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

vector<int> g[100007];
queue<int> q;
int viz[100007];
int prop[100007];

int main()
{
    int n, m, source; in >> n >> m >> source;

    for(int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
    }

    for(int i = 0; i <= n+1; i++)
        viz[i] = (1<<30);

    viz[source] = 0;
    q.push(source);
    while(!q.empty())
    {
        int cnt = q.front(); q.pop();

        if(prop[cnt]) continue;
        prop[cnt] = 1;

        for(auto vec : g[cnt])
        {
            if(viz[vec] > viz[cnt] + 1)
            {
                viz[vec] = viz[cnt] + 1;
                q.push(vec);
            }
        }
    }

    for(int i = 1; i <= n; i++)
    {
        out << ((viz[i] == (1<<30)) ? (-1) : (viz[i]));
        out << ' ';
    }

    return 0;
}