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

ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,s,x,y,dist[100001];

vector < int >a[100001];

void bfs(int nod)
{
    int nct;
    queue < int >Q;
    Q.push(nod);
    dist[nod]=0;
    while(!Q.empty())
    {
        nct=Q.front();
        for(unsigned int i=0;i<a[nct].size();i++)
        {
            if(dist[a[nct][i]]==-1)
            {
                Q.push(a[nct][i]);
                dist[a[nct][i]]=1+dist[nct];
            }
        }
        Q.pop();
    }
}

int main()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    for(int j=1;j<=n;j++)
        dist[j]=-1;
    bfs(s);
    for(int j=1;j<=n;j++)
        g<<dist[j]<<" ";
    return 0;
}