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

using namespace std;

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

int mn[100005];
int n, m, x, y, start;
vector <int> nod[100005];
queue <int> q;

void read()
{
    fin >> n >> m >> start;

    for (int i = 0; i < m; ++ i) {
        fin >> x >> y;
        nod[x].push_back(y);
    }
}

int main()
{
    read();

    for(int i=1;i<=n;i++)
        mn[i]=-1;

    mn[start]=0;
    q.push(start);

    while(!q.empty())
    {
        int pos=q.front();
        q.pop();

        for(int i=0;i<nod[pos].size();i++)
        {
            if(mn[nod[pos][i]]==-1){
                mn[nod[pos][i]]=mn[pos]+1;
                q.push(nod[pos][i]);
            }
        }
    }

    for(int i=1;i<=n;i++)
        fout<<mn[i]<<" ";

    return 0;
}