#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define MAX 100005

int n, m, s, a, b, d[MAX];
vector<int> g[MAX];
queue<int> q;

void bfs()
{
    for(int i = 1; i <= n; ++i)
    {
        d[i] = -1;
    }
    q.push(s);
    d[s] = 0;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for(int i = 0; i < g[x].size(); ++i)
        {
            if(d[g[x][i]] == -1)
            {
                d[g[x][i]] = d[x] + 1;
                q.push(g[x][i]); 
            }
        }
    }
}

int main()
{
    cin >> n >> m >> s;
    for(int i = 1; i <= m; ++i)
    {
        cin >> a >> b;
        g[a].push_back(b);
    }
    bfs();
    for(int i = 1; i <= n; ++i)
    {
        cout << d[i] << ' ';
    }
    cout << '\n';
    return 0;
}