#include <bits/stdc++.h>

using namespace std;

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

const int oo = 1e9;
int n, m, d[100005];
vector<int>V[100005];
int viz[100005];
int start;

void BFS()
{
    int i;
    queue<int>q;
    for(i = 1;i <= n;i++)
        d[i] = oo;
    d[start] = 0;
    q.push(start);
    while(!q.empty())
    {
        int k = q.front();
        q.pop();
        for(auto x : V[k])
        {
            if(d[x] > d[k] + 1)
            {
                d[x] = d[k] + 1;
                q.push(x);
            }
        }
    }
    for(i = 1;i <= n;i++)
        if(d[i] == oo)
            fout << "-1 ";
        else
            fout << d[i] << " ";
}
void Citire()
{
    int i, x, y;
    fin >> n >> m >> start;
    for(i = 1;i <= m;i++)
    {
        fin >> x >> y;
        V[x].push_back(y);
    }

}

int main()
{
    Citire();
    BFS();
    return 0;
}