#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define double long double;
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

ll n, m, s, dist[100005];
bool used[100005];
vector<ll> v[100005];
queue<ll> q;

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

void BFS()
{
    while(!q.empty())
    {
        ll node=q.front();
        q.pop();
        for(auto i:v[node])
        {
            if(!used[i])
            {
                q.push(i);
                used[i]=1;
                dist[i]=dist[node]+1;
            }
        }
    }
}

void solve()
{
    fin>>n>>m>>s;
    for(ll i=0;i<m;i++)
    {
        ll x, y;
        fin>>x>>y;
        v[x].pb(y);
    }
    q.push(s);
    used[s]=1;
    dist[s]=0;
    BFS();
    for(ll i=1;i<=n;i++)
    {
        if(used[i]){fout<<dist[i]<<' ';}else{fout<<-1<<' ';}
    }
}

int32_t main()
{
    //ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}