#include <iostream>
#include <queue>
#include <map>
#include <vector>
#include <fstream>
 
 
using namespace std;
 
int n,m;
 vector<int> graf[100005];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
void bfs(int nod)
{queue<int> coada;
bool visited[n];
int distanta[n];
    for(int i = 0; i <=n; i++)
        {visited[i] = false;
        distanta[i] =-1;}
visited[nod] = true;
distanta[nod] = 0;
coada.push(nod);
 
while(!coada.empty())
    {
 
       int s = coada.front();
        //cout << s << " ";
 
 
 
      vector<int>::iterator it;
        for ( it = graf[s].begin(); it != graf[s].end(); ++it)
        {
 
            if (!visited[*it])
            {
                distanta[*it] = distanta[s] + 1;
 
 
                visited[*it] = true;
 
                coada.push(*it);
            }
 
 
        }     coada.pop();
 
    }
    ///cout<<endl;
    for(int i=1;i<=n;i++)
        fout<<distanta[i]<<" ";
 
}
 
int main()
{
int x,y,nod;
fin>>n>>m>>nod;
for(int i=0;i<m;i++)
    {fin>>x>>y;
    graf[x].push_back(y);}
bfs(nod);
    return 0;
}