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

using namespace std;

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

const int NMAX = 100005;

int N, M, S;
vector <int> g[NMAX];
int vis[NMAX];

queue < pair <int, int> > Q;

void BFS(int node)
{
    vis[node] = 0;
    Q.push({node, 0});

    while(!Q.empty())
    {
        int currentNode = Q.front().first;
        int currentDist = Q.front().second;
        Q.pop();

        for(auto it : g[currentNode])
            if(vis[it] == -1)
            {
                vis[it] = currentDist + 1;
                Q.push({it, currentDist + 1});
            }
    }
}

int main()
{
    int x, y;

    fin >> N >> M >> S;

    for(int i = 1; i <= N; i++)
        vis[i] = -1;

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

    BFS(S);

    for(int i = 1; i <= N; i++)
        fout << vis[i] << ' ';

    return 0;
}