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

vector <int> graf[100010];
int sol[100010];

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    int n,m,a,b,s;
    in>>n>>m>>s;
    while(m--)
    {
        in>>a>>b;
        graf[a].push_back(b);
    }
    memset(sol,-1,sizeof(sol));
    queue <int> q;
    int nod;
    sol[s]=0;
    q.push(s);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(auto i : graf[nod])
            if(sol[i]==-1)
            {
                sol[i]=sol[nod]+1;
                q.push(i);
            }
    }
    for(int i=1;i<=n;i++)
        out<<sol[i]<<" ";

    return 0;
}