#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");


int main()
{
    int N,M,S,i,x,y;
    queue <int> q;
    vector <int> a[10005];
    in>>N>>M>>S;
    vector <int> d(N+1,-1);
    d[S]=0;
    for(i=1;i<=M;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    q.push(S);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(i=0;i<a[nod].size();i++)
        {
            if(d[a[nod][i]]==-1)
            {
                d[a[nod][i]]=d[nod]+1;
                q.push(a[nod][i]);
            }
        }
    }
    for(i=1;i<=N;i++)
        out<<d[i]<<" ";
    return 0;
}