#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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


queue <int> q;
int n,m,s,el;
vector  <int> gr[100010];
int viz[100010];

void citire()
{
    f>>n>>m>>s;
    int x,y;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        gr[x].push_back(y);

    }
}

void bfs()
{
   viz[s]=1;
    q.push(s);
    while (!q.empty())
    {
        el=q.front();
        q.pop();
        for (auto i:gr[el])
        {
            if (viz[i]==0)
            {
                viz[i]=viz[el]+1;
                q.push(i);
            }
        }
    }
}


int main()
{
    citire();
    bfs();
    for(int i=1;i<=n;i++)
        cout<<viz[i]-1<< " ";
    return 0;
}