#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define MAX 100003
vector <int> la[MAX];
queue <int> q;
int n, m, dist[MAX], s;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
void bfs();
int main()
{
    int x, y, i;
    fin>>n>>m>>s;
    for(i=1; i<=m; i++){
        fin>>x>>y;
        la[x].push_back(y);
    }
    bfs();
    for(i=1; i<=n; i++)
        fout<<dist[i]-1<<' ';
    return 0;
}
void bfs()
{
    int nod;
    dist[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(int i=0; i<la[nod].size(); i++)
            if(dist[la[nod][i]]==0)
            {
                dist[la[nod][i]] = dist[nod] + 1;
                q.push(la[nod][i]);
            }
    }

}