#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector <int> v[100001]; //lista de adiacenta
int dist[100001];
const int inf=2e9;

int n, m, x, y, k;

void bfs(int nod)
{
    for(int i=1; i<=n; i++)
        dist[i]=inf;
    dist[nod]=0;
    queue <int> q;
    q.push(nod);
    while(!q.empty())
    {
        int current = q.front();
        q.pop();
        for(int i=0; i<v[current].size(); i++)
            if(dist[v[current][i]] > dist[current] + 1)
                  {
                      dist[v[current][i]] = dist[current] + 1;
                           q.push(v[current][i]);
                  }
    }
}

int main()
{
    fin>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y); //il pun pe y in lista lui x de adiacenta (sunt vecini)
    } //graf orientat
    bfs(k);
    for(int i=1; i<=n; i++)
    {
        if (dist[i]==inf)
            fout<<"-1 ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}