#include <fstream>
#include <queue>

using namespace std;

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

queue < int > q;
vector < int > Muchii[100001];
bool vizitat[100001];
int dist[100001];
int n, m, start;

void bfs()
{
    while(!q.empty())
    {
        int nod = q.front();
        vizitat[nod] = 1;
        q.pop();
        for(auto k : Muchii[nod])
            if(!vizitat[k])
            {
                q.push(k);
                dist[k] = dist[nod] + 1;
            }
    }
}

int main()
{
    f >> n >> m >> start;
    for(; m; m--)
    {
        int x, y;
        f >> x >> y;
        Muchii[x].push_back(y);
    }

    q.push(start);
    dist[start] = 0;
    bfs();

    for(int i = 1; i <= n; i++)
        if(dist[i] == 0 && start != i)
            g << "-1 ";
        else
            g << dist[i] << " ";

    return 0;
}