#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,i,j,x,a,m,s,b;
vector<int>v[100010];
queue <int>q;
int viz[100010],cost[100010];
void bfs(int nod)
{
    viz[nod]=1;
    q.push(nod);
    while(!q.empty())
    {
        int aux=q.front();
        q.pop();
        for(int i=0;i<v[aux].size();i++)
            if(viz[v[aux][i]]==0)
            {
                viz[v[aux][i]]=1;
                cost[v[aux][i]]=cost[aux]+1;
                q.push(v[aux][i]);
            }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        if(i==s)
            fout<<"0 ";
        else if(cost[i]==0)
            fout<<"-1 ";
        else fout<<cost[i]<<" ";
    }
    return 0;
}