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

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

int n,m, start;

vector <int> G[MAXN];
queue <int> Q;
int viz[MAXN];
void bfs()
{
    Q.push(start);
    viz[start]=1;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(auto &x:G[nod])
            if(!viz[x])
                Q.push(x), viz[x]=1+viz[nod];
    }
}
void af()
{
    for(int i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
}
void citire()
{
    fin>>n>>m>>start;
    int x,y;
    for(int i=0;i<m;i++)
        fin>>x>>y, G[x].push_back(y);
    bfs();
    af();
}
int main()
{
    citire();
    return 0;
}