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

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

int n, m, nod, x, y, c, cost[100005];
bool viz[100005];
vector <int> v[100005];
queue <int> Q;

void bfs(int nod)
{
    viz[nod] = 1;
    cost[nod] = 0;
    Q.push(nod);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(auto it: v[x])
        {
            if(!viz[it])
            {
                viz[it] = 1;
                Q.push(it);
                cost[it] = cost[x] + 1;
            }
        }
    }
}

int main(unsigned)
{
    fin >> n >> m >> nod;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }

    bfs(nod);
    for(int i = 1; i <= n; i++)
        fout << (viz[i]==1 ? cost[i]:-1) << ' ';
}