#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;

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

vector<vector<int>> g;
int n,m,s,x,y;
vector<int> viz;
vector<int> dist;
queue<int> q;


void citire(){
    fin>>n>>m>>s;
    g.resize(n+1);
    for(int i = 1; i <= m; i++)
        {
            fin>>x>>y;
            g[x].push_back(y);
        }
    dist.resize(n+1,-1);
    viz.resize(n+1,0);
}

void BFS(int start)
{
    q.push(start);
    viz[start]=1;
    dist[start]=0;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(auto &v: g[u])
            if(viz[v]==0)
            {
                viz[v]=1;
                dist[v]=dist[u]+1;
                q.push(v);
            }
    }
}

void afisare(){
    for(int i = 1; i < dist.size(); i++)
        fout<<dist[i]<<" ";
}

int main()
{
    citire();
    BFS(s);
    afisare();
    return 0;
}