#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N = 100001;
int n,m,s;
queue <int> coada;
vector <int> muchii[N];
int rez[N];
void bfs(){
    while(!coada.empty()){
        int x = coada.front();
        coada.pop();
        for(int i=0;i<muchii[x].size();i++){
            int y=muchii[x][i];
            if(rez[y]==0){
                rez[y] = rez[x]+1;
                coada.push(y);
            }
        }
    }
}
int main()
{
    in>>n>>m>>s;
    coada.push(s);
    rez[s]=1;

    for(int i=1;i<=m;i++){
        int x,y;
        in>>x>>y;
        muchii[x].push_back(y);
    }
    bfs();
    for(int i=1;i<=n;i++){
        out<<rez[i]-1<<" ";
    }
    return 0;
}