#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;

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

int drum[NMAX], viz[NMAX];
list<int> *l;

void bfs(int v)
{
    queue<int> q;
    q.push(v);

    int lungime = 0;

    while(!q.empty())
    {
        int nod = q.front(); q.pop();
        viz[nod] = 1; lungime++;

        for(auto it = l[nod].begin(); it != l[nod].end(); it++)
            if(viz[*it] == 0)
            {
                viz[*it] = 1;
                drum[*it] = drum[nod]+1;
                q.push(*it);
            }
    }
}

int main()
{
    int n, m, s;
    in >> n >> m >> s;

    l = new list<int>[n+1];

    for(int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;

        l[x].push_back(y);
    }

    bfs(s);

    for(int i = 1; i <= n; i++)
    {
        if(drum[i] == 0) out << (i==s? 0:-1) << ' ';
        else out << drum[i] << ' ';
    }

    return 0;
}