#include <fstream>
#include <vector>
#include <queue>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,start,x,y,dp[nmax];
vector<int>v[nmax];
queue<int>q;
void bfs(int start){
    dp[start]=0;
    q.push(start);
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto i:v[nod])
            if(dp[i]==-1){
                dp[i]=dp[nod]+1;
                q.push(i);
            }
    }
}
int main()
{
    cin>>n>>m>>start;
    for(int i=1;i<=n;i++)
        dp[i]=-1;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        v[x].push_back(y);
    }
    bfs(start);
    for(int i=1;i<=n;i++)
        cout<<dp[i]<<" ";
    return 0;
}