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