#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
FILE *f=fopen("bfs.in","r");
FILE *g=fopen("bfs.out","w");
queue<int>q;
vector<int>L[100001];
int dist[100001],n,m,nod,viz[100001];
void bfs(int i)
{
    int j,x;
    viz[i]=1;
    q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(j=0;j<L[x].size();j++)
        {
            if(viz[L[x][j]]==0)
            {
                q.push(L[x][j]);
                viz[L[x][j]]=1;
                dist[L[x][j]]=dist[x]+1;
            }
        }
    }
}
int main()
{
    int i,x,y;
    fscanf(f,"%d%d%d",&n,&m,&nod);
    for(i=1;i<=m;i++)
        {
            fscanf(f,"%d%d",&x,&y);
            L[x].push_back(y);
        }
    bfs(nod);
    for(i=1;i<=n;i++)
        if(dist[i]==0&&i!=nod)
            fprintf(g,"-1 ");
        else fprintf(g,"%d ",dist[i]);

    return 0;

}