#include <bits/stdc++.h>

using namespace std;

int n,m,a,b,s;
vector <int> v[100010];
bool viz[100010];
queue <int> Q;
int dist[100010];

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in>>n>>m>>s;
    for (int i=0;i<m;i++)
    {
        in>>a>>b;
        v[a].push_back(b);

    }
    for (int i=1;i<=n;i++)
        dist[i]=-1;
    Q.push(s);
    viz[s]=1;
    dist[s]=0;
    while (!Q.empty()){
        int nod=Q.front();
        Q.pop();

        for (int i=0;i<v[nod].size();i++){
        if (!viz[v[nod][i]]){
                if (dist[v[nod][i]]>dist[nod]+1 || dist[v[nod][i]]==-1) dist[v[nod][i]]=dist[nod]+1;
            Q.push(v[nod][i]);
            viz[v[nod][i]]=1;
            }
        }
    }

    for (int i=1;i<=n;i++){
        out<<dist[i]<<' ';
    }

    return 0;
}