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

#define MAXN 100005
#define INF 0x3f3f3f3f

ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector<int> graf[MAXN];
queue<int> coada;
int dist[MAXN];
int n,m,i,j,x,y,st,crt;

int main()
{
    cin>>n>>m>>st;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
        dist[i]=INF;
    }

    dist[st]=0;  coada.push(st);
    while(!coada.empty())
    {
        crt=coada.front(); coada.pop();
        for(i=0; i < graf[crt].size(); i++)
            if(dist[ graf[crt][i] ] > dist[crt] + 1)
            {
                dist[ graf[crt][i] ] = dist[crt] + 1;
                coada.push(graf[crt][i]);
            }
    }
    for(i=1; i<=n; i++)
        if(dist[i] == INF)
            cout<<-1<<" ";
        else
            cout<<dist[i]<<" ";
    return 0;
}