#include <fstream>
#include <vector>
#include <queue>
using namespace std ;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int> g[100002];
int viz[100002],n,m,Nod,k;
void bfs(int nod){
    viz[nod]=1;
    queue<int> q;
    q.push(nod);
    while(!q.empty()){
        int nc=q.front();
        q.pop();
        for(auto it : g[nc]){
            if(viz[it]==0){
                q.push(it);
                viz[it]=viz[nc]+1;
            }
        }
    }
}
int main()
{
    cin>>n>>m>>Nod;
    int x,y;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        g[x].push_back(y);
    }
    bfs(Nod);
    for(int i=1;i<=n;i++){
        cout<<viz[i]-1<<' ';
    }
    return 0 ;
}