#include <bits/stdc++.h>
#define pb push_back

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int N=100009;
typedef pair<int,int> Pair;
int n,m,k,d[N],ans[N];
vector <int> v[N];
queue <Pair> q;
int main()
{
    fin.sync_with_stdio(false);
    fin>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].pb(y);
    }
    for(int i=1;i<=n;i++)
        ans[i]=-1;
    q.push({k,0});
    d[k]=1;
    while(!q.empty())
    {
        int nod=q.front().first,level=q.front().second;
        ans[nod]=level;
        q.pop();
        for(auto it:v[nod])
            if(!d[it])
            {
                d[it]=1;
                q.push({it,level+1});
            }
    }
    for(int i=1; i<=n; i++)
        fout<<ans[i]<<" ";
    return 0;
}