#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

const int N=100010;
vector<int> v[N];
int n,m,s,d[N];
queue<int> Q;
int i,j;

int main()
{
    f>>n>>m>>s;
    for(;m;m--)
    {
        f>>i>>j;
        v[i].push_back(j);
    }
    d[s]=1;
    Q.push(s);

    while(Q.size())
    {
        i=Q.front();
        Q.pop();
        for(auto it:v[i])
            if(!d[it])
        {
            d[it]=d[i]+1;
            Q.push(it);
        }
    }

    for(i=1;i<=n;i++)
        g<<d[i]-1<<' ';
    return 0;
}