#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

const int N=100005;
int n,m,d[N],s;
vector <int> v[N];
queue <int> q;

int main()
{
    f>>n>>m>>s;
    for(; m; m--)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }
    q.push(s);
    d[s]=1;
    while(q.size())
    {
        int nod=q.front();
        q.pop();
        for(auto vec: v[nod])
                if(!d[vec])
        {
            d[vec]=d[nod]+1;
            q.push(vec);
        }
    }
    for(int i=1;i<=n;i++)
        g<<d[i]-1<<' ';
    return 0;
}