#include <bits/stdc++.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int> v[100005];
int n,m,vis[100005],x,y,ans,s,d[100005];
queue<int> q;
void bfs(int nod)
{
    q.push(nod);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();

        for(auto it:v[x])
            if(d[x]+1<d[it])
        {
            d[it]=d[x]+1;
            q.push(it);
        }
    }
}
int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++) d[i]=1e9;
    d[s]=0;
    bfs(s);

    for(int i=1;i<=n;i++)
        if(d[i]!=1e9) out<<d[i]<<" ";
        else out<<-1<<" ";
    return 0;
}