#include <bits/stdc++.h>

using namespace std;

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

const int N=1e5+5;

struct lista
{
    vector <int> v;
    bool parcurs;
    int sol;
}la[N];

void bfs(int x)
{
    queue<int> q;
    q.push(x);
    la[x].parcurs=1;

    while(!q.empty())
    {
        for(int i=0;i<la[q.front()].v.size();i++)
            if(!la[ la[q.front()].v[i] ].parcurs)
        {
            la[ la[q.front()].v[i] ].parcurs=1;
            la[ la[q.front()].v[i] ].sol=la[q.front()].sol+1;
            q.push(la[q.front()].v[i]);
        }
        q.pop();
    }
}

int main()
{
    int n,m,r;
    in>>n>>m>>r;

    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y;
        la[x].v.push_back(y);
    }

    bfs(r);

    for(int i=1;i<=n;i++)
    {
        if(!la[i].parcurs) la[i].sol=-1;
        out<<la[i].sol<<' ';
    }
    return 0;
}