#include <fstream>
#include <vector>
#define len 100010
#define pb push_back

using namespace std;

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

vector<unsigned> v[len];

unsigned N, M, S;
bool viz[len];
int dist[len];

void dfs(unsigned nod)
{
    viz[nod] = true;
    for(unsigned k = 0; k < v[nod].size(); ++k)
        if(!viz[v[nod][k]])
        {
            dist[v[nod][k]] = dist[nod] + 1;
            dfs(v[nod][k]);
        }
}

int main()
{
    in >> N >> M >> S;
    for(unsigned i = 1; i <= M; ++i)
    {
        unsigned x, y;
        in >> x >> y;
        v[x].pb(y);
    }
    for(unsigned i = 1; i <= N; ++i)
        dist[i] = (i == S ? 0 : -1);
    dfs(S);
    for(unsigned i = 1; i <= N; ++i)
        out << dist[i] << ' ';
    return 0;
}