#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <vector<int>> v;
queue <int> q;
int d[100001];
int n,m;
void f(int start)
{
    for (int i=1;i<=n;i++) d[i]=1e9;
    int st=1,dr=1;
    d[start]=0;
    q.push(start);
    while (!q.empty())
    {
        int i=q.front();
        q.pop();
        for (int j=0;j<v[i].size();j++)
        {
            if (d[i]+1<d[v[i][j]])
            {
                q.push(v[i][j]);
                d[v[i][j]]=d[i]+1;
            }
        }
    }
}
int main()
{
    v.resize(100001);
    fin >>n>>m;
    int start;
    fin >>start;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fin >>x>>y;
        v[x].push_back(y);
    }
    f(start);
    for (int i=1;i<=n;i++)
    {
        if (d[i]==1e9) fout << -1;
        else fout << d[i];
        fout <<" ";
    }
}