#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m , x, y,start;
const int NMAX = 100003;
vector <int> v[NMAX];
queue <int> Q;
bool viz[NMAX];
int sol[NMAX];
inline void BFS(int start)
{
    Q.push(start);
    viz[start]=1;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(int i=0;i<v[nod].size();i++)
            if(viz[v[nod][i]]==0)
            {
                viz[v[nod][i]]=1;
                sol[v[nod][i]]=sol[nod]+1;
                Q.push(v[nod][i]);
            }
    }
}
int main()
{
    f>>n>>m>>start;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    BFS(start);
    for(int i=1;i<=n;i++)
        if(sol[i]==0 && i!=start)
            g<<"-1 ";
        else
            g<<sol[i]<<" ";
    return 0;
}