#include<bits/stdc++.h>
#define MAX 100005
#define pb push_back
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,s,viz[MAX],x,a,b;
vector<int> v[MAX];
queue<int> q;
void bfs(int nod)
{
    q.push(nod);
    viz[nod]=1;
    while(q.empty()==0)
    {
        x=q.front();
        q.pop();
        for(int y:v[x])
        {
            if(viz[y]==0)
            {
                viz[y]=viz[x]+1;
                q.push(y);
            }
        }
    }
}



int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b;
        v[a].pb(b);
    }

    bfs(s);

    for(int i=1;i<=n;i++)
    {
        fout<<viz[i]-1<<" ";
    }

    return 0;
}