#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N = 100010;
int n,m,s,d[N];
vector<int> v[N];
queue<int> q;
int main ()
{
    f>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }
    d[s]=1;
    q.push(s);
    while(q.size())
    {
        int nod=q.front();
        for(auto vec:v[nod])
            if(!d[vec])
            {
                d[vec]=d[nod]+1;
                q.push(vec);
            }
        q.pop();
    }
    for(int i=1; i<=n; i++)
        g<<d[i]-1<<' ';
    return 0;
}