#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

#define MAX 100010

vector <int> v[MAX];
queue <int> q;

int viz[MAX];

int main()
{
    int n,m,s,a,b;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
    }
    viz[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int j=q.front();
        q.pop();
        for(int i=0;i<v[j].size();i++)
            if(!viz[v[j][i]])
            {
                viz[v[j][i]]=viz[j]+1;
                q.push(v[j][i]);
            }
    }
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
            fout<<-1<<" ";
        else
            fout<<viz[i]-1<<" ";
    }
    return 0;
}