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

using namespace std;

vector<int>graph[100005];
queue<int>q;

int n, m, s,x,y;

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

int viz[100005];

void parcurgere()
{
    q.push(s);
    while (!q.empty())
    {
        x=q.front();
        q.pop();
        for (auto &v:graph[x])
        {
            if (viz[v]==0)
            {
                viz[v]=viz[x]+1;
                q.push(v);
            }
        }
    }
}

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