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

///#include <PRACTICE>

using namespace std;

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

const int NMAX=1e5+5;
int dist[NMAX];

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

void bfs(int x)
{
    dist[x]=0;
    q.push(x);
    while(!q.empty())
    {
        int p=q.front();
        for(auto i:v[p])
        {
            if(dist[i]==0)
            {
                dist[i]=dist[p]+1;
                q.push(i);
            }
        }
        q.pop();
    }
}

int main()
{
    int n,m,S,i,j,x,y;
    fin>>n>>m>>S;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(S);
    for(i=1;i<=n;i++)
    {
        if(dist[i]==0)
            fout<<"-1 ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}