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

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
const int N = 1e5 + 1;
vector <int> a[N];

int n, m, s, d[N];
queue <int> q;
void citire ()
{
    fin >> n >> m >> s;
    for (int i=0; i<m; i++){
        int x, y;
        fin >> x >> y;
        a[x].push_back(y);

    }
    fin.close();

}
void BFS()
{
    while (!q.empty()){
        int x = q.front();
        q.pop();
        for (auto y: a[x]){
            if (d[y] == -1){
                q.push(y);
                d[y] = 1 + d[x];
            }
        }
    }
}
int main()
{
    citire();
    for (int i=1; i<=n; i++)
        d[i] = -1;

    q.push(s);
    d[s] = 0;
    BFS();
    for (int i=1; i<=n; i++)
        fout << d[i] << " ";
    return 0;
}