/**
Breadth First Search
*/
#include <cstdio>
#include<iostream>
#include<fstream>
#include <vector>
#include <queue>
using namespace std;

vector <int> lv[100001];
queue <int> q;
bool used[100001];
int dmin[100001];

int main()
{
    int n,m,st,x,y,i,nc,dist;
    //FILE *f=fopen("bfs.in","r");
    ifstream f("bfs.in");
    //fscanf(f,"%d%d%d",&n,&m,&st);
    f>>n>>m>>st;
    for(i=1;i<=m;i++)
    {
        //fscanf(f,"%d%d",&x,&y);
        f>>x>>y;
        if(x!=y)
            lv[x].push_back(y);
    }
    for(i=1;i<=n;i++)dmin[i]=-1;
    dmin[st]=0;
    used[st]=1;
    q.push(st);
    vector <int>::iterator ii;
    while(!q.empty())
    {
        nc=q.front();
        q.pop();
        dist=dmin[nc];
        for(ii=lv[nc].begin();ii!=lv[nc].end();++ii)
            if(!used[*ii])
            {
                used[*ii]=1;
                q.push(*ii);
                dmin[*ii]=dist+1;
            }
    }
    //fclose(f);
    f.close();
    //f=fopen("bfs.out","w");
    ofstream f1("bfs.out");
    for(i=1;i<=n;i++)
        //fprintf(f,"%d ",dmin[i]);
        f1<<dmin[i]<<" ";
    return 0;
}