#include <bits/stdc++.h>

using namespace std;
vector<int>v[100005];
queue<int>q;
bool viz[100005];
int dist[100005];
void bfs(int node)
{
    viz[node]=1;
    q.push(node);
    while(q.size()>0)
    {
        int nd=q.front();
        q.pop();
        for(auto x : v[nd])
        {
            if(viz[x]==0)
            {
                q.push(x);
                dist[x]=dist[nd]+1;
                viz[x]=1;
            }
        }
    }
}
int main()
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");

    int n,m,a,b,nod;
    cin>>n>>m>>nod;
    for(int i=0; i<m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);

    }
bfs(nod);

    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
        {
            cout<<-1;
        }
        else cout<<dist[i];
        cout<<" ";
    }

    return 0;
}