//
//  main.cpp
//  Bfs
//
//  Created by Darius Buhai on 24/11/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,s, viz[100001], el;
queue<int> q;
vector<int> a[100001];

void read()
{
    fin>>n>>m>>s;
    int x,y;
    for(int i=0;i<m;i++){
        fin>>x>>y;
        a[x].push_back(y);
    }
}

void bfs()
{
    viz[s]=1;
    q.push(s);
    while (!q.empty())
    {
        el=q.front();
        q.pop();
        for (auto i:a[el])
        {
            if (viz[i]==0)
            {
                viz[i]=viz[el]+1;
                q.push(i);
            }
        }
    }
}

int main() {
    read();
    bfs();
    for(int i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
    return 0;
}