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

using namespace std;

const string filename = "bfs";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

int n, m, s, dist[100005];
vector <int> G[100005];
queue <int> q;

void bfs(int sursa)
{
    for(int i = 1; i <= n; i++)
        dist[i] = -1;
    q.push(sursa);
    dist[sursa] = 0;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int vecin : G[nod])
            if(dist[vecin] == -1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
    }
}

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