#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define MAXN 100010

using namespace std;

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

vector<int> edges[MAXN];
queue<int> q;
int cost[MAXN], used[MAXN];

void read (int &n, int &m,int &s)
{
    fin>>n>>m>>s;
    for (int i=0;i<m;i++)
    {
        int x,y;
        fin>>x>>y;
        edges[x].push_back(y);
    }
}

void solve (int n, int m, int s)
{
    for (int i=1;i<=n;i++)
        cost[i]=-1;

    cost[s]=0;
    used[s]=1;
    q.push(s);

    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        for (auto &i: edges[x])
        {
            if (!used[i])
            {
                cost[i]=cost[x]+1;
                used[i]=1;
                q.push(i);
            }
        }
    }



}

int main()
{
    int n,m,s;
    read(n,m,s);
    solve(n,m,s);
    for (int i=1;i<=n;i++)
        fout<<cost[i]<<" ";
    return 0;
}