#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s;
vector<int> graf[100005];
queue<int> coada;
int costuri[100005];
bool vizitat[100005];
void BFS(int s)
{
    int x;
    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();
        for(int i=0;i<graf[x].size();i++)
        {
            if(!vizitat[graf[x][i]])
            {
                coada.push(graf[x][i]);
                vizitat[graf[x][i]]=1;
                costuri[graf[x][i]]=costuri[x]+1;
            }
        }
    }
}

int main()
{
    int x,y,i;
    in>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        graf[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        costuri[i]=-1;
    costuri[s]=0;
    vizitat[s]=1;
    coada.push(s);
    BFS(s);
    for(i=1;i<=n;i++)
        out<<costuri[i]<<" ";
    in.close();
    out.close();
    return 0;
}