#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
int viz[100005];
int N,M,S,x,y,i;
 ifstream fin("bfs.in");
    ofstream fout("bfs.out");
void BFS(vector <vector<int>> G,int start)
{

    queue <int> S;
    viz[start]=1;
   // vector <int> contor;
    S.push(start);
    while(!S.empty())
    {
        int v=S.front();
        S.pop();
        for(i=0;i<G[v].size();i++)
        {
            if(viz[i]==0)
            {
                viz[i]=viz[i]+1;
                S.push(i);
            }
        }
    }
    for(i=0;i<N;i++)
    {
        fout<<viz[i]-1<<' ';
    }
}
int main()
{


    fin>>N>>M>>S;
    vector < vector<int> > G(M);
    for(i=1;i<=M;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);

    }
    BFS(G,1);
    fin.close();
    fout.close();
    return 0;
}