#include<iostream>
#include<fstream>
#include<list>
#include<queue>
#include<bitset>
#include<cstdio>
using namespace std;
const int PCT=100002;
list<int>gr[PCT];
struct punct
{
    int q;
    int l;
};
    bitset<PCT> viz;
void bfs(int n,int s)
{

    queue<punct> p;
    int b[n];
    list<int>::iterator i;
    p.push({s,0});
    viz[s]=1;
    b[s]=0;
    punct str;

    while(p.size())
    {
        str=p.front();
        p.pop();
        for(i=gr[str.q].begin();i!=gr[str.q].end();++i)
        {
            if(viz[*i]==0)
            {
                b[*i]=str.l+1;
                p.push({*i,b[*i]});
                viz[*i]=1;
            }
        }
    }
    FILE*so=fopen("bfs.out","w");
    int j;
    for(j=0;j<n;++j)
    {
        if(!viz[j])
        {
            fprintf(so,"-1 ");
        }
        else
        {
            fprintf(so,"%i ",b[j]);
        }
    }
    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);
    --s;
    int i,a,c;
    for(i=0;i<m;++i)
    {
        fscanf(si,"%i %i",&a,&c);
        gr[a-1].push_back(c-1);
    }
    bfs(n,s);
    return 0;
}