#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int nmax = 100005;
vector<int> list_vec[nmax];
vector<int> viz;

void bfs(int start)
{
    queue<int> q;
    int temp;

    viz[start] = 0;
    q.push(start);

    while(!q.empty())
    {
        temp = q.front();
        q.pop();
        for(auto i : list_vec[temp])
        {
            if(viz[i] == -1)
            {
                viz[i] = viz[temp] + 1;
                q.push(i);
            }
        }
    }
}
int main()
{
    int n, m, start, u, v, i;
    fin>>n>>m>>start;


    for(i = 1; i <= m; ++i)
    {
        fin>>u>>v;
        list_vec[u].push_back(v);
    }

    viz.assign(n + 1, -1);

    bfs(start);

    for(i = 1; i <= n; ++i)
        fout<<viz[i]<<' ';
    return 0;
}