#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N=1e5+5;
vector <int> v[N];
queue <int> q;
int val[N],n,vf;
bool viz[N];
void bfs(int x)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        int t=q.front();
        for(int i=0;i<v[t].size();i++)
        {
            if(!viz[v[t][i]])
            {
                val[v[t][i]]=val[t]+1;
                viz[v[t][i]]=1;
                q.push(v[t][i]);
            }
        }
        q.pop();
    }
}
int main()
{
    int m;
    f>>n>>m>>vf;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs(vf);
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            g<<-1<<" ";
        }
        else
        g<<val[i]<<" ";
    }
    return 0;
}