#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,x,y,start;
int d[100001];
vector<vector<int>> a(100001,vector<int>());

void BFS(int nod)
{
    d[nod] = 0;
    queue<int> q;
    q.push(nod);
    while(!q.empty())
    {
        int prim = q.front();
        q.pop();

        for(vector<int>::iterator it=a[prim].begin();it!=a[prim].end();++it)
            if(d[*it] == -1)
            {
                d[*it] = d[prim] + 1;
                q.push(*it);
            }
    }
}

int main()
{
    f>>n>>m>>start;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1;i<=n;++i)
        d[i] = -1;
    BFS(start);
    for(int i=1;i<=n;++i)
        g<<d[i]<<" ";
    return 0;
}