#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
#define MAXN 100001
#define INF 0x3f3f3f3f
int n,m,start,x,y,nod;
vector<int> graf[MAXN];
queue<int> coada;
int dist[MAXN];

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

    dist[start]=0;

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

}