#include<bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>v[100001];
queue<int>q;
bool viz[100001];
int d[100001];
int main()
{
    int n,m,s;
    fin>>n>>m>>s;
    fill(d,d+100001,1000000001);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        v[a].push_back(b);
    }
    q.push(s);
    viz[s]=true;
    d[s]=0;
    while(!q.empty())
    {
        int nod=q.front();
        viz[nod]=true;
        q.pop();
        for(auto x:v[nod])
            if(!viz[x])
            {
                d[x]=d[nod]+1;
                q.push(x);
            }
    }
    for(int i=1;i<=n;i++)
    {
        if(d[i]!=1000000001)
            fout<<d[i];
        else fout<<-1;
        fout<<" ";
    }
}