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

using namespace std;

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

int n, m, s, x, y;

vector<int> v[100010];
int viz[100010];
queue<int> q;

void bfs()
{
    int nod;
    q.push(s);
    viz[s] = 1;
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for (int i = 0; i < v[nod].size(); i++)
            if (!viz[v[nod][i]])
            {
                q.push(v[nod][i]);
                viz[v[nod][i]] = viz[nod] + 1;
            }
    }
}

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