#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define lim 100005

using namespace std;

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

vector <int> v[lim];
queue <int> q;

int n, m, p[lim], nr;

void afis()
{
    for(int i=1; i<=n; ++i)
    {
        out<<p[i]<<" ";
    }
}

void bfs(int start)
{
    p[start]=0;
    q.push(start);
    while(!q.empty())
    {
        int ii=q.front();
        for(int i=0; i<v[ii].size(); ++i)
        {
            if(p[v[ii][i]]<0)
            {
                p[v[ii][i]]=p[ii]+1;
                q.push(v[ii][i]);
            }

        }
        q.pop();
    }
    afis();
}

void read()
{
    in>>n>>m>>nr;
    for(int i=1; i<=m; ++i)
    {
        int x, y;
        in>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
        p[i]=-1;
    bfs(nr);
}

int main()
{
    read();
    return 0;
}