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

#define nmax 100005

using namespace std;

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

vector <vector <int> > a(nmax);
queue <int> q;
int n, m, s;
int viz[nmax];

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

void BFS(int nod)
{
    viz[nod]=1;
    q.push(nod);
    while(!q.empty())
    {
        int varf=q.front();
        q.pop();
        for(int i=0; i<a[varf].size(); ++i)
        {
            if(viz[a[varf][i]]==0)
            {
                viz[a[varf][i]]=viz[varf]+1;
                q.push(a[varf][i]);
            }
        }
    }
    for(int i=1; i<=n; ++i)
    {
        g<<viz[i]-1<<" ";
    }
}

int main()
{
    citire();
    BFS(s);
    return 0;
}