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

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m, s, x, y;
vector<int> g[100005];
int viz[100000];
void lee()
{
    int crt_pos=s;
    queue<int> q;
    q.push(crt_pos);
    viz[crt_pos]=0;
    while(!q.empty())
    {
        crt_pos=q.front();
        for(auto &v: g[crt_pos])
            if(viz[v]==-1)
            {
                q.push(v);
                viz[v]=viz[crt_pos]+1;
            }
        q.pop();
    }
}
int main()
{
    fin>>n>>m>>s;
    memset(viz, -1, sizeof(viz));
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    lee();
    for(int i=1; i<=n; i++)
        fout<<viz[i]<<" ";
    return 0;
}