#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g ("bfs.out");
vector <int>v[100005];
deque <int>d;
int viz[100005];
int sol[100005];
void BFS(int s)
{
    int nod,i;
    d.push_back(s);
    viz[s] = 1;
    while(d.empty() == false)
    {
        nod = d[0];
        for(i = 0; i < v[nod].size(); i++)
            if(viz[v[nod][i]] == 0)
            {
                d.push_back(v[nod][i]);
                sol[v[nod][i]] = sol[nod] + 1;
                viz[v[nod][i]] = 1;
            }
        d.pop_front();
    }

}

int main()
{
    int n,m,x,y,s;
    f >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    BFS(s);
    for(int i = 1; i <= n; i++)
        if(viz[i] == 0)
            g << -1 << " ";
        else
            g << sol[i] << " ";

    return 0;
}