#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> G[100005];
queue <int> q;
int viz[100005],n,m,x,y,s,lg[100005];
long long cont;
void bfs()
{
    x=q.front();
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto v:G[nod])
        {
            if(!viz[v])
            {
                viz[v]=1;
                lg[v]=lg[nod]+1;
                q.push(v);
            }
        }
    }
}
int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    viz[s]=1;
    q.push(s);
    bfs();
    for(int i=1;i<=n;i++)
    {
        if(!viz[i])out<<-1;
        else out<<lg[i];
        out<<' ';
    }
    return 0;
}