#include<fstream>
#include<vector>
#include<queue>

#define dmax 100003

using namespace std;

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

int n, m, s;

vector<int>adj[dmax];
vector<int>::iterator it;

queue<int>q;

int d[dmax];


void bfs()
{
    for(int i=1; i<=n; i++)
        d[i] = -1;


    q.push(s);
    d[s] = 0;

    while(!q.empty() )
    {
        int currentN = q.front();
        q.pop();

        for(it = adj[currentN].begin(); it < adj[currentN].end(); it++)
        {
            if(d[*it] == -1)
            {
                d[*it] = d[currentN] + 1;
                q.push(*it);
            }

        }
    }

    for(int i=1; i<=n; i++)
        out<<d[i]<<" ";

}


int main()
{
    in>>n>>m>>s;

    for(int i=1; i<=m; i++)
    {
        int a, b;

        in>>a>>b;

        adj[a].push_back(b);
    }

    in.close();

    bfs();

    out.close();

    return 0;

}