#include<iostream>
#include<fstream>
#include<vector>
#include<list>
#include<queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int m,n,s;
vector<list<int>> arce;
vector<int> cost;
vector<int> gasit;

void BFS(int sursa)
{
    queue<int> ceva;
    ceva.push(sursa);
    gasit[sursa]=1;
    while(!ceva.empty())
    {
        int x=ceva.front();
        ceva.pop();
        for(int i:arce[x])
        {   
            if(gasit[i]==0)
            {ceva.push(i);
            cost[i]=cost[x]+1;}
            gasit[i]=1;
        }

    }

}

int main()
{
    fin>>n>>m>>s;
    cost.resize(n+5);
    arce.resize(n+5);
    gasit.resize(n+5);
    int x,y;
    while(fin>>x>>y)
    {
        arce[x].push_back(y);
    }

    BFS(s);
    for(int i=1;i<=n;i++)
        if(i!=s && cost[i]==0) fout<<"-1 ";
         else fout<<cost[i]<<" ";
        
        
    
    


}