#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 100005

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector < int >v[nmax];
queue < int >q;

int n, m, x, y, s, viz[nmax];

void citire()
{
    fin >> n >> m >> s;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
}

void dfs()
{
    q.push(s);
    viz[s] = 1;
    while(!q.empty())
    {
        int aux = q.front();
        q.pop();
        for(vector < int > :: iterator it=v[aux].begin(); it!=v[aux].end(); ++it)
        {
            if (viz[*it] == 0)
            {
                q.push(*it);
                viz[*it]=viz[aux]+1;
            }
        }
    }
    for(int i=1; i<=n; i++)
        fout << (viz[i]-1)<<" ";
}

int main()
{
    citire();
    dfs();
    return 0;
}