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

using namespace std;

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

int n, m, s, viz[100005];
vector <int> a[100005];
queue <int> q;

void bfs()
{
    int x;
    q.push(s);
    while(!q.empty())
    {
        x = q.front();
        for(unsigned i=0; i<a[x].size(); i++)
            if(!viz[a[x][i]])
            {
                viz[a[x][i]] = viz[x] + 1;
                q.push(a[x][i]);
            }
        q.pop();
    }
}

int main()
{
    fin>>n>>m>>s;
    int x, y;
    while(m--)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }

    viz[s] = 1;
    bfs();
    for(int i=1; i<=n; i++)
        if(viz[i]-1 || i == s)fout<<viz[i]-1<<' ';
        else fout<<-1<<' ';

    return 0;
}