#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m, d[100005], s;
vector<int> G[100005];


void BFS(int x)
{
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    d[x] = 0;
    queue<int> q;
    q.push(x);
    while(!q.empty())
    {
        int curr = q.front();
        q.pop();
        for(auto i : G[curr])
            if(d[i] == -1)
            {
                d[i] = 1 + d[curr];
                q.push(i);
            }
    }
}
int main()
{
    int i,j;
    fin >> n >> m >> s;
    while(m--)
    {
        fin >> i >> j;
        G[i].push_back(j);
    }
    BFS(s);
    for(i = 1; i <= n; i++)
        fout << d[i] << " ";
    return 0;
}