#include <fstream>
#include <vector>
#include <bitset>
#include <queue>

using namespace std;

int n,m,s;
const int NMAX = 100001;
vector<pair<int,int> >muchii;
vector<pair<int,int> >::iterator it;
queue<int> coada;
int *mark;
bitset<NMAX> viz;

void citire()
{
    scanf("%d",&n);
    scanf("%d",&m);
    scanf("%d",&s);
    int x,y;
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&x);
        scanf("%d",&y);
        muchii.push_back(make_pair(x,y));
    }
    fclose(stdin);
}

void parcurgere()
{
    coada.push(s);
    viz.set(s);
    while(!coada.empty())
    {
        int x = coada.front();
        for(it = muchii.begin();it<muchii.end();it++)
            if(((*it).first == x) && !viz.test((*it).second))
        {
            coada.push((*it).second);
            mark[(*it).second] = mark[x] + 1;
            viz.set((*it).second);
        }
    coada.pop();
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    mark = new int[n+1];
    for(int i=1;i<=n;i++)
    mark[i] = (i==s) ? 0: -1;
    parcurgere();
    for(int i=1;i<=n;i++)
       printf("%d ",mark[i]);
    fclose(stdout);
    delete[] mark;
    return 0;
}