#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> adj[100001];
queue<int>q;
int distanta[100001];
int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;
        adj[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        distanta[i] = -1;
    q.push(s);
    distanta[s]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int vecin: adj[nod])
        {
            if(distanta[vecin]== -1)
            {
                distanta[vecin]=distanta[nod]+1;
                q.push(vecin);
            }
        }
    }
    for(int i=1;i<=n;i++)
        fout<<distanta[i]<<' ';
    
}