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

int n, m, s;

vector<int> v,a[100005];

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

void parc()
{
    queue<int> Q;
    Q.push(s);
    v[s]=0;
    while(!Q.empty())
    {
        int x = Q.front();
        Q.pop();
        for(auto i=0; i<a[x].size(); i++)
            if(v[a[x][i]]==-1){
                Q.push(a[x][i]);
                v[a[x][i]] = v[x]+1;
            }
    }
    for(auto i=1; i<=n; i++)
        fout<<v[i]<<" ";
}

int main()
{
    citire();
    parc();
}