#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, s;
vector<int> G[100001];
int dist[100001];

void bfs(int nod)
{
    queue<int> que;

    for(int i=1; i<=n; i++)
        dist[i] = -1;

    dist[nod] = 0;
    que.push(nod);

    while(!que.empty())
    {
        int x = que.front();
        que.pop();
        for(int i=0; i<G[x].size(); i++)
        {
            int y = G[x][i];
            if(dist[y] == -1)
            {
                que.push(y);
                dist[y] = dist[x] + 1;
            }
        }
    }
}


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

    bfs(s);

    for(int i=1; i<=n; i++)
        fout << dist[i] << " ";

    return 0;
}