#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,drum[100005],nd;
vector <int> v[100005];
queue <int> q;

void bfs()
{
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto it=v[nod].begin();it<v[nod].end();it++)
        {
            int nxt=*it;
            if(drum[nod]+1<drum[nxt])
            {
                drum[nxt]=drum[nod]+1;
                q.push(nxt);
            }
        }
    }
}

int main()
{
    fin>>n>>m>>nd;

    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }

    memset(drum,INF,sizeof(drum));
    drum[nd]=0;
    q.push(nd);
    bfs();

    for(int i=1;i<=n;i++)
    {
        if(drum[i]==INF)
            fout<<-1<<" ";
        else
            fout<<drum[i]<<" ";
    }
    return 0;
}