#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
#include <queue>
using namespace std;

const int n_max =  100005;
const int inf = 0x3f3f3f3f;

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

vector <int> v[n_max];
queue <int> q;
int n,m,s,d[n_max];

void citire()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
}

void bfs(int nod)
{
    d[nod] = 0;
    q.push(nod);
    while(!q.empty())
    {
        int nod_nou = q.front();
        q.pop();

        for(int i=0; i<v[nod_nou].size(); ++i)
            if(d[v[nod_nou][i]] == -1)
            {
                d[v[nod_nou][i]] += d[nod_nou] + 2;
                q.push(v[nod_nou][i]);
            }
    }
}

int main()
{
    citire();
    memset(d, -1, sizeof d);

    bfs(s);

    for(int i=1;i<=n;++i)
        fout<<d[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}