#include<bits/stdc++.h>
#define maxn 100005
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,S;
int viz[maxn]={0},dist[maxn];

//lista de adiacenta
vector <int> v[maxn];
queue <int> q;

void citire()
{
    fin>>n>>m>>S;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
}

void bfs(int x)
{
    int node;

    q.push(x);
    viz[x]=1;

    while(!q.empty())
    {
        node=q.front();
        q.pop();

        for(int i=0;i<v[node].size();i++)
        {
            if(viz[v[node][i]]==0)
            {
                viz[v[node][i]]=1;
                q.push(v[node][i]);
                dist[v[node][i]]=dist[node]+1;
            }
        }
    }
}

int main()
{
    citire();
    bfs(S);

    for(int i=1;i<=n;i++)
    {
        if(dist[i]==0 && i!=S)
            fout<<-1<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}