#include<bits/stdc++.h>
#include<queue>
#include<vector>
using namespace std;
const int NMAX=100002;
queue <int> q;
vector <int> a[NMAX];
int cost[NMAX];
int n,m,start,current;
void BFS(int nod)
{
    memset(cost,-1,sizeof(cost));
    cost[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        current=q.front();
        q.pop();
        //cout<<current<<" ";
        for(int j=0;j<a[current].size();j++)
        {
            if(cost[a[current][j]]==-1)
            {
                //cout<<a[current][j]<<"*\n";
                q.push(a[current][j]);
                cost[a[current][j]]=cost[current]+1;
                //cout<<a[current][j]<<" "<<cost[a[current][j]]<<"\n";
            }
        }
        //q.pop();
    }
}
int main()
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int i, x, y;
    cin>>n>>m>>start;
    for(int i=0;i<m;i++)
    {
        cin>>x>>y;
        a[x].push_back(y);
    }
    BFS(start);
    for(int i=1;i<=n;i++)
        cout<<cost[i]<<" ";
    return 0;
}