#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

int dist[100010];
vector<int> v[100010];
queue<int> q;
int s,n,m,x,y;

int bfs()
{
    while(!q.empty())
    {
        int nod=q.front();
        while(!v[nod].empty())
        {
            int next=v[nod].back();
            if(dist[next]==-1)
            {
                q.push(next);
                dist[next]=dist[nod]+1;
            }
            v[nod].pop_back();
        }
        q.pop();
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d %d %d",&n,&m,&s);

    for(int i=1;i<=n;i++)
    {
        dist[i]=-1;
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
    }
    q.push(s);
    dist[s]=0;
    bfs();
    for(int i=1;i<=n;i++)
    {
        printf("%d ",dist[i]);
    }
}