#include <bits/stdc++.h>
#define nMax 100005

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

int n, m, s, x, y, d[nMax];
vector<int> G[nMax];
queue<int> Q;
bitset<nMax> viz;

void bfs(int nod)
{
    viz[nod]=1;
    Q.push(nod);
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(auto i:G[nod])
            if(!viz[i])
        {
            d[i]=d[nod]+1;
            viz[i]=1;
            Q.push(i);
        }
    }
}

int main()
{
    fin >> n >> m >> s;
    while(m--)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
        if(d[i]==0 && i!=s)
            fout << "-1 ";
        else
            fout << d[i] << " ";
    return 0;
}