#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstdio>
using namespace std;

int n,m,s,x,y,viz[10001],nrs[10001];
vector<int>a[10001];

    ifstream in("bfs.in");
    ofstream out("bfs.out");

void bfs()
{

    int nod;
    queue<int> coada;
    coada.push(s);

    while(!coada.empty())
    {
        nod = coada.front();
        coada.pop();
        viz[nod] = 1;
        for(int i=0;i<a[nod].size();i++)
        {
            if(viz[a[nod][i]]==0)
            {
                nrs[a[nod][i]] = nrs[nod]+1;
                viz[a[nod][i]]=1;
                coada.push(a[nod][i]);
            }
        }
    }
}

int main()
{

    in >> n >> m >> s;
    for(int i=0;i<m;i++)
    {
        in >> x >> y;
        a[x].push_back(y);
    }
    bfs();
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==1)
            out << nrs[i] << " ";
        else
            out << -1 << " ";
    }
    return 0;
}