#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[100001];
const int MAXI = 100001;
bitset<MAXI> viz;
int drum[100001]={-1};
queue<int> q;
void bfs(int x)
{
    q.push(x);
    viz[x]=1;
    drum[x]=0;
    while(!q.empty())
    {
        int cur = q.front();
        q.pop();
        for(int i: v[cur])
        {
            if(viz[i]==0)
            {
                viz[i]=1;
                drum[i]=drum[cur]+1;
                q.push(i);

            }
        }
    }
}
int main()
{
    int n, m, a;
    f >> n >> m >> a;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f >> x >> y;
        v[x].push_back(y);
    }
    bfs(a);
    for(int i=1; i<=n; i++)
    {
        if(!drum[i] && i!=a)
        {
            g << drum[i]-1 << " ";
        }else g << drum[i] << " ";
    }
}