#include <bits/stdc++.h>

using namespace std;

const int N=100000+5;

int n,m,s;
vector<int>g[N];
int ans[N];
queue<int>q;

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    while(m--)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
    }
    q.push(s);
    ans[s]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto &nou:g[nod])
        {
            if(ans[nou]==0)
            {
                ans[nou]=ans[nod]+1;
                q.push(nou);
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<ans[i]-1<<" ";
    }
    cout<<"\n";
    return 0;
}