#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
vector< vector <int> > v;
vector< int > a;
vector< bool > viz;
queue <int> coada;
int main()
{
    int x,y,i,nr;
    f>>n>>m>>s;
    v.resize(n+1);
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    a.resize(n+1);
    viz.resize(n+1);
    viz[s]=1;
    coada.push(s);
    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();
        nr=v[x].size();
        for(i=0;i<nr;i++)
        {
            y=v[x][i];
            if(viz[y]==0)
            {
                coada.push(y);
                a[y]=a[x]+1;
                viz[y]=1;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(a[i]==0 && i!=s)
            g<<-1<<" ";
        else
            g<<a[i]<<" ";
    }
    return 0;
}