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

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

int n, m, s, dist[100001];
bool v[100001];
vector<int> graf[100001];
queue<int> noduri;

void bfs(int nod)
{
    for(int i = 0; i < graf[nod].size(); i++)
    {
        if(dist[graf[nod][i]] == 0 && graf[nod][i] != s)
            dist[graf[nod][i]] = dist[nod] + 1;
            else if(graf[nod][i] != s)
            dist[graf[nod][i]] = min(dist[graf[nod][i]], dist[nod] + 1);
        if(v[graf[nod][i]] == 0)
        {
            noduri.push(graf[nod][i]);
            v[graf[nod][i]] = 1;
        }
    }
}

int main()
{
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        graf[x].push_back(y);
    }
    noduri.push(s);
    v[s] = 1;
    while(!noduri.empty())
    {
        bfs(noduri.front());
        noduri.pop();
    }
    for(int i = 1; i <= n; i++)
    {
        if(dist[i] != 0)
            out << dist[i] << " ";
            else if(i == s)
            out << 0 << " ";
            else
                out << -1 << " ";
    }
    return 0;
}