#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
vector <int>v[100002];
queue <int>q;
vector<int>::iterator it;
int n,m,S,i,nod,viz[100002],x,y;
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&S);
    for (i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        if (x!=y) v[x].push_back(y);
    }
    q.push(S);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for (it=v[nod].begin();it!=v[nod].end();++it)
        {
            if (viz[*it]==0)
            {
                viz[*it]=viz[nod]+1;
                q.push(*it);
            }
        }
    }
    for (i=1;i<=n;++i) if (viz[i]==0) viz[i]=-1;
    viz[S]=0;
    for (i=1;i<=n;++i) printf("%d ",viz[i]);
    return 0;
}