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

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

vector<vector<int> > G;
queue<int> Q;
vector<bool> D;
vector<int> Cost;
int n, m, S;

void Read();
void BFS(int node);
void WriteCost();

int main()
{
    Read();
    BFS(S);
    WriteCost();

    fin.close();
    fout.close();
    return 0;
}

void BFS(int node)
{
    Q.push(node);
    Cost[node] = 0; D[node] = true;
    vector<int>::iterator it;
    while ( !Q.empty() )
    {
        int curr = Q.front();
        Q.pop();
        for (it = G[curr].begin(); it != G[curr].end(); ++it)
        {
            if ( D[*it] != 0 ) continue;
            D[*it] = true;
            Cost[*it] = Cost[curr] + 1;
            Q.push(*it);
        }
    }
}

void WriteCost()
{
    for (int i = 1; i <= n; ++i)
        fout << Cost[i] << ' ';
    fout << '\n';
}

void Read()
{
    fin >> n >> m >> S;
    int x, y;
    D.resize(n+1);
    Cost.resize(n+1);
    G.resize(n+1);
    for (int i = 1; i <= n; ++i)
        Cost[i] = -1;

    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
}