#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
queue <int> Q;
vector <int> G[100001];
int src, n, m,dist[100001];
int read()
{int a,b;
    f>>n>>m>>src;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b;
        G[a].push_back(b);

    }
}
void BFS()
{

    while(!Q.empty())
    {

        for( auto x:G[Q.front()])
    {
       if(dist[x]==0 && x!=src){ Q.push(x);
        dist[x]=dist[Q.front()]+1;
    }
    }
Q.pop();
    }
}
int main()
{
    read();

    Q.push(src);

    BFS();
    for(int i=1;i<=n;i++)
    {
        if(dist[i]==0 && i!=src) g<<-1<<" ";
        else g<<dist[i]<<" ";
    }
}