#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
#define MAX 100010
int n,m,start;
vector <int> G[MAX];
queue <int> q;
int dist[MAX];
void bfs(int nod)
{
    q.push(nod);
    while(!q.empty())
    {
        int nd=q.front();
        q.pop();

        for(int i = 0; i < G[nd].size(); i++)
            if(dist[G[nd][i]] == -1)
            {
                q.push(G[nd][i]);
                dist[G[nd][i]] = dist[nd] + 1;
            }

    }
}
int main()
{
    int x,y;
    fin >> n >> m >> start;
    for(int i=1;i<=m;i++)
    {
        fin >> x >>y;
        G[x].push_back(y);
    }
    for(int i=0; i<=n; i++)
        dist[i]=-1;
    dist[start]=0;
    bfs(start);
    for(int i=1; i<=n;i++)
        fout << dist[i] << " ";

    return 0;
}