#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> v[100005];

int n,m,i,viz[100005],s,f[100005];

void dfs(int nod)
{
    viz[nod]=1;
    for(auto it=v[nod].begin(); it!=v[nod].end(); it++)
    {
        int nxt=*it;
        if(!viz[nxt])
        {
            f[nxt]=f[nod]+1;
            dfs(nxt);
        }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    dfs(s);
    for(i=1;i<=n;i++)
    {
        if(f[i]==0 && i!=s)
            fout<<-1<<" ";
        else
            fout<<f[i]<<" ";
    }
    return 0;
}