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

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n, m, i, j, s, x, y, nod;
int rez[100002];
vector <int> a[100002];
queue <int> q;
bool viz[100002];

int main()
{
    f >> n >> m >> s;
    for (i = 1; i <= m; i++)
    {
        f >> x >> y;
        a[x].push_back(y);
    }
    rez[s] = 1;
    viz[s] = 1;
    q.push(s);
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        for (i = 0; i < a[nod].size(); i++)
            if (viz[a[nod][i]] == 0)
            {
                q.push(a[nod][i]);
                viz[a[nod][i]] = 1;
                rez[a[nod][i]] = rez[nod]+1;
            }
    }
    for (i = 1; i <= n; i++)
        g << rez[i]-1 << " ";

    return 0;
}