#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define N 100001

using namespace std;

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

vector<int> a[N];
int n, m, s;
int dist[N];

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

void bfs(int start)
{
    queue<int> q;

    for(int i=1; i<=n; i++)
        dist[i] = -1;

    dist[start] = 0;
    q.push(start);

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

        for(int i=0; i<a[nod].size(); i++)
        {
            int vecin = a[nod][i];
            if(dist[vecin] == -1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    citire();
    bfs(s);

    for(int i=1; i<=n; i++)
        fout<<dist[i]<<" ";

    return 0;
}