#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define DM 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, a, b, viz[DM], dist[DM];
vector <int> g[DM];
queue <int> q;

void bfs(int start)
{
    viz[start] = 1;
    q.push(start);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto it : g[nod])
            if(!viz[it])
            {
                dist[it] = dist[nod] + 1;
                viz[it] = 1;
                q.push(it);
            }
    }
}
int main()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b;
        g[a].push_back(b);
    }
    bfs(s);

    for(int i = 1; i <= n; i++)
        if(!viz[i])
            dist[i] = -1;
    for(int i = 1; i <= n; i++)
        fout << dist[i] << ' ';
    return 0;
}