#include <bits/stdc++.h>

using namespace std;

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

int n,m,s,D[100005],seen[100005];

vector <int> V[100005];

deque <int> q;

int main()
{
    fin>>n;
    fin>>m;
    fin>>s;

    for(int i = 1;i<=m;i++)
    {
        int x,y;

        fin>>x>>y;

        V[x].push_back(y);
    }
    for(int i = 1;i<=n;i++)
        D[i] = -1;

    q.push_back(s);
    D[s] = 0;
    seen[s] = 1;

    while(!q.empty())
    {
        int nod;

        nod = q.front();
        q.pop_front();

        for(auto vecin:V[nod])
        {
            if(seen[vecin] == 0)
            {
                D[vecin] = D[nod] + 1;
                seen[vecin] = 1;
                q.push_back(vecin);
            }
        }
    }
    for(int i = 1;i<=n;i++)
    {
        fout<<D[i]<<' ';
    }

}