#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, s, drum[100010];
queue<int>Q;
vector<int>graf[100010];
void citire()
{
    f>>n>>m>>s;
    int x, y;
    for(int i=0; i<m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }
    Q.push(s);
    drum[s]++;
}
void bfs()
{
    while(!Q.empty())
    {
        int x=Q.front();
        for(auto &v:graf[x])
            if(drum[v]==0)
            {
                Q.push(v);
                drum[v]=drum[x]+1;
            }
        Q.pop();
    }
}
int main()
{
    citire();
    bfs();
    for(int i=1; i<=n; i++)
        g<<drum[i]-1<<' ';
    return 0;
}