#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

using namespace std;

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

int n, m, nr, s;
vector <int> v[100005];
queue <int> q;
int used[100005];

void bfs(int x)
{
    int ok = 0;
    used[x] = 1;
    q.push(x);
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(auto it: v[x])
        {
            if(!used[it])
            {
                q.push(it);
                used[it] = used[x]+1;
            }
        }
    }
}

int main()
{
    f >> n >> m >> s;
    for(int i = 1 ; i <= m ; i++)
    {
        int x,y;
        f >> x >> y;
        v[x].push_back(y);
    }

    bfs(s);

    for(int i = 1 ; i <= n ; i++)
    {
        if(used[i] != 0)
            g << used[i]-1 << " ";
        else
            g << "-1 ";
    }

    return 0;
}