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

using namespace std;

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

const int Nmax = 100005, INF = 1000005;
int dp[Nmax];
vector<int> L[Nmax];
queue<int> q;

void bfs(){
    int nod;
    while(!q.empty()){
        nod = q.front();
        for(int vec : L[nod]){
            if(dp[vec]>dp[nod]+1){
                dp[vec] = dp[nod]+1;
                q.push(vec);
            }
        }
        q.pop();
    }
}

int main()
{
    int n,m,s,i,x,y;
    fin >> n >> m >> s;
    for(i=1;i<=m;i++){
        fin >> x >> y;
        L[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        dp[i] = INF;
    dp[s] = 0;
    q.push(s);
    bfs();
    for(i=1;i<=n;i++){
        if(dp[i] == INF)
            fout << "-1 ";
        else
            fout << dp[i] << " ";
    }
    return 0;
}