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

using namespace std;

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

const int MAXn=100005;

int dist[MAXn];

vector<int> adj[MAXn];

int main()
{
    int n,m,s;
    for(int i=0;i<MAXn;++i)
        dist[i]=-1;
    fin>>n>>m>>s;
    int x,y;
    while(fin>>x>>y)
    {
        adj[x].push_back(y);
    }
    queue<int> q;
    q.push(s);
    dist[s]=0;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(auto y : adj[x])
        {
            if(dist[y]==-1)
            {
                dist[y]=dist[x]+1;
                q.push(y);
            }
        }
    }
    for(int i=1;i<n;++i)
    {
        fout<<dist[i]<<' ';
    }
    fout<<dist[n];

}