#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
queue <int> q;
vector<vector<int>>G;
int dist[100005];
void chestie()
{
    for(int i=0;i<=100004;i++)
        dist[i]=-1;
}
void BFS(int node)
{
    q.push(node);
    dist[node]=0;
    while(!q.empty())
    {
        int curr_node=q.front();
        q.pop();
        for(int ngb: G[curr_node])
        {
            if(dist[ngb]==-1)
            {
                q.push(ngb);
                dist[ngb]=dist[curr_node]+1;
            }
        }
    }
}
int main()
{
    chestie();
    int n,m,s;
    fin>>n>>m>>s;
    G.resize(n+1);
    for(int i=0;i<m;i++)
    {
        int node1, node2;
        fin>>node1>>node2;
        G[node1].push_back(node2);
    }
    BFS(s);
    for(int i=1;i<=n;i++)
        fout<<dist[i]<<" ";
}