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

int viz[100001];
queue <int> q;
vector <int> v[100001];
int nr_min_arce[100001];

void bfs(int nod)
{
    q.push(nod);
    viz[nod]=1;
    nr_min_arce[nod]=1;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int i=0; i<v[x].size(); i++)
        {
            if(!viz[v[x][i]])
            {
                q.push(v[x][i]);
                viz[v[x][i]]=1;
                nr_min_arce[v[x][i]]=nr_min_arce[x]+1;

            }
        }
    }
}

int main()
{
    int n,m,s;
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f >> n >> m >> s;
    for(int i=0; i<m; i++)
    {
        int x,y;
        f >> x >> y;
        v[x].push_back(y);
    }

    bfs(s);
    for(int i=1;i<=n;i++)
        g<<nr_min_arce[i]-1<< " ";
    return 0;
}