#include<cstdio>
#include<queue>
#include<vector>
#define NMAX 100001
using namespace std;
vector<int> G[NMAX];
bool viz[NMAX];
int dist[NMAX];
int n,m,s;
void citeste_graf()
{
    int a1,a2;
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1; i<=m; ++i)
    {
        scanf("%d%d",&a1,&a2);
        G[a1].push_back(a2);
    }
}
void bfs()
{
    int nod;
    queue<int> coada;
    coada.push(s);
    viz[s]=true;
    while(!coada.empty())
    {
        nod=coada.front();
        for(int i=0; i<G[nod].size(); ++i)
        {

            if(!viz[G[nod][i]])
            {
                coada.push(G[nod][i]);
                dist[G[nod][i]]=dist[nod]+1;
                viz[G[nod][i]]=true;
            }

        } //inchide for
        coada.pop();
    }

}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citeste_graf();
    bfs();
    for(int i =1 ; i<=n; ++i)
        if(viz[i]==true)
            printf("%d ",dist[i]);
        else printf("-1 ");

}