#include <bits/stdc++.h>
using namespace std;
const int NMAX=100005;
vector<int>v[NMAX];
int dist[NMAX];
void Bfs(int x)
{
    dist[x]=0;
    priority_queue<pair<int,int>>pq;
    pq.push({0,x});
    while(!pq.empty())
    {
        int a=pq.top().first*-1;
        int b=pq.top().second;
        pq.pop();
        for(auto i:v[b])
        {
            if(dist[i]>a+1)
            {
                dist[i]=a+1;
                pq.push({-dist[i],i});
            }
        }
    }
}
int main()
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)
        dist[i]=INT_MAX;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
    }
    Bfs(k);
    for(int i=1;i<=n;i++)
    {
        if(dist[i]==INT_MAX)
            dist[i]=-1;
        cout<<dist[i]<<" ";
    }


    return 0;
}