#include <bits/stdc++.h>
#define IOS ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define NMAX 100005

using namespace std;

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

vector <int> muchii[NMAX];
int lg[100005] , n , m , s;
bool viz[NMAX];

queue <int> Q;

void BFS(int nod)
{
    viz[nod] = 1;
    Q.push(nod);
    lg[nod] = 0;
    while(!Q.empty())
    {
        int curent = Q.front();
        Q.pop();
        for(int i = 0 ; i < muchii[curent].size() ; i ++)
            if(!viz[muchii[curent][i]])
            {
                viz[muchii[curent][i]] = 1;
                Q.push(muchii[curent][i]);
                lg[muchii[curent][i]] = lg[curent] + 1;
            }
    }
    for(int i = 1 ; i <= n ; i ++)
        if(i != nod && !viz[i])
            lg[i] = -1;
}

int main()
{
    IOS
    fin >> n >> m >> s;
    for(int i = 1 ; i <= m ; i ++)
    {
        int x , y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }
    BFS(s);
    for(int i = 1 ; i <= n ; i ++)
        fout << lg[i] << ' ';
    return 0;
}