#include<bits/stdc++.h>
using namespace std;

const int NMax = 1e5;
const int VIZ = -1;
vector<int>v[NMax + 5];
queue<int>q;
int dist[NMax];

int set_viz(int n)
{
    for(int i = 1; i <= n; i++)
        dist[i] = VIZ;
}

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

int main()
{
    int x, y, n, m, s;
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    for(int i = 1; i <= m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    q.push(s);
    set_viz(n);
    dist[s] = 0;
    bfs();
    for(int i = 1; i <= n; i++)
        fout<<dist[i]<<" ";
    return 0;
}