#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
vector<int> v[100003];
queue<int> q;
bool frev[100003];
int prev_node[100003];
void Citire()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }    
}
void BFS(int node, int cnt)
{
    //cout<<node<<" "<<cnt<<"\n";
    if(!q.empty())
        q.pop();
    //cout<<node<<" ";        
    for(int i=0;i<v[node].size();i++)
    {
        if(frev[v[node][i]]==false)
        {
            prev_node[v[node][i]]=prev_node[node]+1;            
            frev[v[node][i]]=true;
            q.push(v[node][i]);
        }
    }   
    if(!q.empty())
        BFS(q.front(),cnt+1);   
}
void Solve()
{
    frev[s]=true;
    BFS(s,1);
    for(int i=1;i<=n;i++)
    {
        if(prev_node[i]==0 && i!=s)
            g<<"-1"<<" ";
        else
            g<<prev_node[i]<<" ";
    }
        
}
int main()
{
    Citire();
    Solve();
}