#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue<int>cd;
int n,m,x,y,start,i,viz[100010],nra[100010];
vector<int> v[100010];
int main()
{
    fin>>n>>m>>start;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    viz[start]=1;
    nra[start]=0;
    cd.push(start);
    while(!cd.empty())
    {
        x=cd.front();
        cd.pop();
        for(i=0;i<v[x].size();i++)
        {
            if(viz[v[x][i]]==0)
            {
                nra[v[x][i]]=nra[x]+1;
                viz[v[x][i]]=1;
                cd.push(v[x][i]);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i]==1)
            fout<<nra[i]<<" ";
        else
            fout<<-1<<" ";
    }
    return 0;
}