#include <cstdio>
#include<vector>
#include<deque>
using namespace std;
vector<int> v[100010];
int n,m,i,d[100010],x,y,s;
deque<int> Q;
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for(;m;m--)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    Q.push_back(s);d[s]=1;
    for(;Q.size();)
    {
        m=Q.front();x=d[m]+1;
        for(vector<int>::iterator it=v[m].begin();it!=v[m].end();it++)
            if(!d[*it])
            {
                d[*it]=x;
                Q.push_back(*it);
            }
        Q.pop_front();
    }
    for(i=1;i<=n;i++)
        printf("%d ",d[i]-1);
    return 0;
}