#include <fstream>
#include <vector>
#include <queue>
#define numaru 100001
using namespace std;
vector<int> Graf[numaru];
bool vizitat[numaru];
int nrarce[numaru];
int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    int n,m,s,i,j,d;
    f>>n>>m>>s;
    for(;m;--m)
    {
        f>>i>>j;
        Graf[i].push_back(j);
    }
    queue< pair <int, int > > coada;
    coada.push(make_pair(s,0));
    while(!coada.empty())
    {
        i=(coada.front()).first;
        d=(coada.front()).second;
        vizitat[i]=true;
        for(j=0;j<Graf[i].size();++j)
            if(!vizitat[Graf[i][j]])coada.push(make_pair(Graf[i][j],d+1));
        nrarce[i]=d;
        coada.pop();
    }
    for(i=1;i<=n;++i) g<<((vizitat[i])?nrarce[i]:-1)<<" ";
    f.close();
    g.close();
    return 0;
}