#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("bfs.in");
ofstream cout ("bfs.out");
vector<int>G[100008];
int n,m,s,i,v[100008],a,b;
queue<int>Q;
void bfs(int nodstart)
{
    for(i=1;i<=n;i++)
        v[i]=-1;
    v[nodstart]=0;
    Q.push(nodstart);
    while(!Q.empty())
    {
        int k=Q.front();
        Q.pop();
        for(auto i:G[k])
        {
            if(v[i]==-1)
            {
                v[i]=v[k]+1;
                Q.push(i);
            }
        }
    }
}
int main()
{
    cin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b;
        G[a].push_back(b);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        cout<<v[i]<<" ";
    return 0;
}