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

using namespace std;

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

vector<unsigned> v[len];

queue<unsigned> q;

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

void bfs(unsigned nod)
{
    viz[nod] = true;
    while(!q.empty())
    {
        unsigned el = q.front();
        q.pop();
        for(unsigned k = 0; k < v[el].size(); ++k)
            if(!viz[v[el][k]])
            {
                viz[v[el][k]] = true;
                q.push(v[el][k]);
                lung[v[el][k]] = lung[el] + 1;
            }
    }
}

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