#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100003];
queue <int> q;

int i,j,n, m, S,a,b,aux, ok,freq[100003],sol[100003],cont;
int main()
{
    fin>>n>>m>>S;
    for(i=0; i<m; i++)
    {
        fin>>a>>b;
        v[a].push_back(b);

    }

    cont=1;
    q.push(S);
    freq[S]=1;

    while(!q.empty())
    {
        aux=q.front();
        cont=sol[q.front()]+1;
        for(int i=0; i<v[aux].size(); i++)
        {
            if(freq[v[aux][i]]!=1)
            {
               sol[v[aux][i]]=cont;
                freq[v[aux][i]]=1;
                q.push(v[aux][i]);
            }
        }

        q.pop();
    }

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

       else
        fout<<sol[i]<<" ";
       }
    return 0;
}