#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int N = 100001;

int n, m, s, cost[N];
vector<int> ad[N];

int main()
{
    fin>>n>>m>>s;
    for(int i=0;i<m;++i)
    {
        int a, b;
        fin>>a>>b;
        ad[a].push_back(b);
    }

    queue<int> q;
    q.push(s);
    fill_n(cost, n+1, -1);
    cost[s]=0;

    while(!q.empty())
    {
        int x = q.front();
        q.pop();

        for(int v : ad[x])
            if (cost[v]==-1)
            {
                q.push(v);
                cost[v] = cost[x]+1;
            }
    }
    for(int i=1;i<=n;++i)
       fout<<cost[i]<<" ";
    return 0;
}