#include <bits/stdc++.h>

using namespace std;

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

queue <int> q;
vector <int> v[100005];
int n, m, a, x, y, l[100005];
bool fr[100005];

void bf (int x)
{
    q.push(x);
    fr[x]=true;
    l[x]=0;
    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        for (auto i:v[x])
        {
            if (!fr[i])
            {
                q.push(i);
                l[i]=l[x]+1;
                fr[i]=1;
            }
        }
    }
}

int main()
{
    fin >> n >> m >> a;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
        l[i]=-1;
    bf(a);
    for (int i=1; i<=n; i++)
        fout << l[i] << " ";
    return 0;
}