#include <bits/stdc++.h>

using namespace std;

ifstream in;
ofstream out;

#define INF 999999999;

vector<int> dist;
vector<bool> visited;

vector<vector<pair<int, int>>> edge;

struct compare
{
    bool operator()(int x,int y)
    {
        if(dist[x]>dist[y])
            return  1;
        else
            return 0;
    }
};

priority_queue<int, vector<int>, compare> q;


void dijkstra(int start)
{
    visited[start]=1;
    dist[start]=0;
    q.push(start);
    while (!q.empty()) {
        int vert;
        vert=q.top();
        q.pop();
        for(int i=0;i<edge[vert].size();i++)
        {
            int near=edge[vert][i].first;
            int cost=edge[vert][i].second;
            if(dist[near]>dist[vert]+cost)
            {
                
                dist[near]=dist[vert]+cost;
                if(!visited[near])
                {
                    q.push(near);
                    visited[near]=1;
                    
                }
            }
        }
    }
}
int n,m,start;
int main()
{
    in.open("bfs.in");
    out.open("bfs.out");
    
    in>>n>>m>>start;
    edge.resize(n+2);
    dist.resize(n+2);
    visited.resize(n+2);
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        in>>x>>y;
        edge[x].push_back({y,1});
    }
    for(int i=1;i<=n;i++)
    {
        dist[i]=INF;
    }
    dijkstra(start);
    for(int i=1;i<=n;i++)
    {
        if(dist[i]== 999999999)
            out<<"-1 ";
        else
            out<<dist[i]<<" ";
    }
    return 0;
}