#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int i,j,n,m,r,s,x,y,lg[100003];
bool ok[1000002];
vector <int> v[1000001];
queue <int> q;
void bf(int x)
{
    while(!q.empty())
    q.pop();
    int i,p=1,nod;
    vector <int> ::iterator it;
    ok[x]=true;
    lg[x]=0;

    q.push(s);
    while(!q.empty())
    {
        nod=q.front();
        for(it=v[nod].begin(); it!=v[nod].end(); it++)
        if(!ok[*it])
        {
            q.push(*it);
            ok[*it]=true;
            lg[*it]=lg[nod]+1;
        }
        q.pop();
    }

}
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);
        v[x].push_back(y);
    }
    bf(s);
    for(i=1; i<=n; i++)
     if (lg[i]==0 && i!=s) printf("-1 "); else printf("%d ",lg[i]);

    return 0;
}