#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector <int> v[100001];
int q[100001],d[100001];
int main()
{
#ifndef HOME
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
#endif // HOME
#ifdef HOME
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m,a,b,i,k;
    cin>>n>>m>>k;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
    }
    for(i=1; i<=n; i++)
        d[i]=INT_MAX;
    d[k]=0;
    int p=0,u=-1;
    q[++u]=k;
    while(p<=u)
    {
        int x=q[p++];
        for(auto it:v[x])
            if(d[it]==INT_MAX)
            {
                d[it]=d[x]+1;
                q[++u]=it;
            }
    }
    for(i=1; i<=n; i++)
        if(d[i]!=INT_MAX)
            cout<<d[i]<<" ";
        else
            cout<<"-1 ";
    return 0;
}