#include <bits/stdc++.h>

using namespace std;

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

int n, m, s;
vector <int> ad[100005];
int d[100005];

void BFS(int k)
{
    queue <int> q;
    q.push(k);
    d[k] = 1;
    while(!q.empty())
    {
        k = q.front();
        q.pop();
        for(int i : ad[k])
            if(d[i] == 0)
            {
                d[i] = d[k] + 1;
                q.push(i);
            }
    }
}

int main()
{
    int x, y;
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        ad[x].push_back(y);
    }
    BFS(s);
    for(int i = 1; i <= n; i++)
        if(d[i] == 0) fout << "-1 ";
        else fout << d[i] - 1 << " ";
    fout << '\n';
    return 0;
}