#define pb push_back
#define nmax 100005
#include <fstream>
#include <string.h>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> G[nmax];
queue <int> Q;
int d[nmax];
int N, M, S;


void citire()
{
    int x,y;
    fin >> N >> M >>S;
    for(int i=1; i<=M; i++)
        {
            fin>>x>>y;
            G[x].pb(y);
        }
    fill(d, d+N+1, -1);
}

void BFS(int nod_start)
{
    int nod;
    d[nod_start]=0;
    Q.push(nod_start);

    while(!Q.empty())
    {
        nod = Q.front(); Q.pop();
        for(int i=0; i<G[nod].size(); i++)
            if(d[G[nod][i]]==-1)
            {
                Q.push(G[nod][i]);
                d[G[nod][i]]=d[nod]+1;
            }
    }
}

void afisare()
{
    for(int i=1; i<=N; i++)
        fout<<d[i]<<' ';
}
int main()
{
    citire();
    BFS(S);
    afisare();
    return 0;
}