#include <bits/stdc++.h>
using namespace std;
int niv[100010],i,m,n,st,x,y;
bool sel[100010];
vector<int>g[100010];
queue<int>q;
void bfs(int x)
{
    sel[x]=true;
    niv[x]=1;
    q.push(x);
    while(!q.empty())
    {
        x=q.front();
        for(i=0; i<g[x].size(); ++i)
            if(!sel[g[x][i]])
            {
                sel[g[x][i]]=true;
                niv[g[x][i]]=niv[x]+1;
                q.push(g[x][i]);
            }
        q.pop();
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&st);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    bfs(st);
    for(i=1; i<=n; ++i)
        printf("%d ",niv[i]-1);
    return 0;
}