#include<iostream>
#include<fstream>
#include<cstring>
#include<queue>
#include<vector>
#include<cstdio>
using namespace std;
const int PCT=100002;
vector<int> gr[PCT];
int cost[PCT];
queue<int> q;
void bfs(int n,int s)
{
    q.push(s);
    cost[s]=0;
    int poz,i;
    while(q.size())
    {
        poz=q.front();
        q.pop();
        for(i=0;i<gr[poz].size();++i)
        {
            if(cost[gr[poz][i]]==-1)
            {
                cost[gr[poz][i]]=cost[poz]+1;
                q.push(gr[poz][i]);
            }
        }
    }
    FILE*so=fopen("bfs.out","w");
    for(i=1;i<=n;++i)
    {
        fprintf(so,"%i ",cost[i]);
        //cout<<cost[i]<<' ';
    }
    fprintf(so,"\n");
}
int main()
{
    //ifstream si;
    //si.open("bfs.in");
    FILE*si=fopen("bfs.in","r");
    //ofstream so;
    //so.open("bfs.out");
    int n,m,s;
    fscanf(si,"%i %i %i",&n,&m,&s);
    int i,a,c;
    for(i=0;i<m;++i)
    {
        fscanf(si,"%i %i",&a,&c);
        gr[a].push_back(c);
    }
    memset(cost,-1,sizeof cost);
    bfs(n,s);
    return 0;
}