#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <fstream>
#include <cctype>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <map>
#include <bitset>
#include <stack>
/*  //c++11
#include <unordered_map>
#include <unordered_set>
#include <tuple>
*/

using namespace std;

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

queue<int> Q;
vector<int> V[100001];
int d[100001];
bitset<100001> used;

int main()
{
    //reopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    int n, m, x, y;
    int s;
    fin>>n>>m;
    fin>>s;
    for(int i = 1; i <= m; i++)
    {
        fin>>x>>y;
        V[x].push_back(y);
        //V[y].push_back(x);
    }
    for(int i = 1; i <= n;i++)
        d[i] = -1;

    Q.push(s);
    d[s] = 0;
    used[s] = true;

    while(!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        for(vector<int>::iterator it = V[node].begin(); it != V[node].end(); it++)
            if(!used[*it])
            {
                d[*it] = d[node] + 1;
                used[*it] = true;
                Q.push(*it);
            }
    }
    for(int i = 1;i <= n;i ++)
        fout<<d[i]<<' ';

    return 0;
}


//FILE!!!