#include <fstream>
#include <queue>
#include <limits>
using namespace std;

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

int minim(int a, int b)
{
    return a > b ? b : a;
}

struct muchie
{
    int a, b;
};

int N, M, X;
int d[100001], viz[100001];
muchie v[1000000];

void bfs(int nod)
{
    int i, x;
    queue<int> q;

    q.push(nod);
    viz[nod] = 1;

    while(!q.empty())
    {
        x = q.front();
        q.pop();

        for(i = 0; i < M; i++)
        {
            if(v[i].a == x && (!viz[v[i].b]))
            {

                viz[v[i].b] = 1;
                d[v[i].b] = d[v[i].a] + 1;
                q.push(v[i].b);
            }
        }
    }

    for(i = 1; i < N + 1; i++)
        if(viz[i] == 0)
        {
            if(i == X)
                g << "0 ";
            else
                g << "-1 ";
        }
        else
            g << d[i] << " ";
}

int main()
{
    int i;

    f >> N >> M >> X;

    for(i = 0; i < M; i++)
        f >> v[i].a >> v[i].b;

    bfs(X);

    return 0;
}