#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

int n, m, s, x, y, st, dr;
int dist[NMAX];
vector <int> vecini[NMAX];
queue <int> q;


void bfs()
{
    dist[s] = 1;
    q.push(s);
    while (!q.empty())
    {
        int i = q.front();
        for (int j = 0; j < vecini[i].size(); ++j)
        {
            if (dist[vecini[i][j]] == 0 || dist[i] + 1 < dist[vecini[i][j]])
            {
                q.push(vecini[i][j]);
                dist[vecini[i][j]] = dist[i] + 1;
            }
        }
        q.pop();
    }
}

int main()
{
    int i;
    in >> n >> m >> s;
    for (i = 1; i <= m; ++i)
    {
        in >> x >> y;
        vecini[x].push_back(y);
    }
    bfs();
    for (i = 1; i <= n; ++i)
    {
        out << dist[i] - 1 << " ";
    }
    return 0;
}