#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> graf[100005];
queue<int> q;
int n,m,s,a,b;
int v[100005];
void bfs(int nodi)
{
    for(int i=1;i<=n;i++)
        v[i]=-1;
    v[nodi]=0;
    q.push(nodi);
    while(!q.empty())
    {
        int i=q.front();
        //cout<<i<<" ";
        q.pop();
        for(auto it:graf[i])
            if(v[it]==-1)
            {
                //cout<<"!";
                v[it]=v[i]+1;
                q.push(it);
            }
    }
}
int main()
{
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        graf[a].push_back(b);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
        cout<<v[i]<<" ";
    return 0;
}