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

using namespace std;

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

vector < int > gr[100100];
bool used[100100];
queue < int > q;
int lv[100100];

int main()
{
    int n,m,s;
    in>>n>>m>>s;

    for(int i=1;i<=m;i++){
        int x,y;
        in>>x>>y;
        gr[x].push_back(y);
    }

    q.push(s);
    used[s]=true;

    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(int i=0;i<gr[nod].size();i++){
            if(!used[gr[nod][i]]){
                q.push(gr[nod][i]);
                used[gr[nod][i]]=true;
                lv[gr[nod][i]]=lv[nod]+1;
            }
        }
    }


    for(int i=1;i<=n;i++){
        if(!used[i]){
            lv[i]=-1;
        }
        out<<lv[i]<<" ";
    }

    return 0;
}