#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 2000000000
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[100001];
queue <int> q;
int S,n,m,i,x,y;
int d[100001];
void bfs(int node)
{
    for(i=1;i<=n;i++)
    {
        d[i]=inf;
    }
    d[node]=0;
    q.push(node);
    while(!q.empty())
    {
        int curr=q.front();
        q.pop();
        for(auto & it: v[curr])
        {
            if(d[it]>d[curr]+1)
            {
                d[it]=d[curr]+1;
                q.push(it);
            }
        }
    }
}
int main()
{
    f>>n>>m>>S;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs(S);
    for(i=1;i<=n;i++)
    {
        if(d[i]==inf) g<<"-1 ";
        else g<<d[i]<<" ";
    }
    return 0;
}