#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
bool viz[100001];
deque <int> p;
int sol[100001];
vector <int> v[100001];
int main()
{
    int n,m,x,y,s,d=0,nod,sz;
    f>>n>>m>>s;
    while(m--)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    p.push_back(s);
    viz[s]=1;
    while(p.empty()==false)
    {
        nod=p[0];
        sz=v[nod].size();
        for(int i=0;i<sz;i++)
        {
            if(viz[v[nod][i]]==0)
            {
                p.push_back(v[nod][i]);
                sol[v[nod][i]]=sol[nod]+1;
                viz[v[nod][i]]=1;
            }
        }
        p.pop_front();
    }
    for(int i=1;i<=n;i++)
        if(sol[i]==0 and i!=s)
            g<<"-1"<<" ";
        else
            if(i!=s)
                g<<sol[i]<<" ";
            else
                g<<"0"<<" ";
    return 0;
}