#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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


queue<int> q;
vector<int>a[100005];
int n, m, s,x, y,viz[100001],el;

void bfs()
{
    viz[s]=1;
    q.push(s);
    while (!q.empty())
    {
        el=q.front();
        q.pop();
        for (auto i:a[el])
        {
            if (viz[i]==0)
            {
                viz[i]=viz[el]+1;
                q.push(i);
            }
        }
    }
}

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

}