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

using namespace std;

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

const int MaxN=100005;
int N,M,S;
vector<int> G[MaxN];
queue<int> Q;
int d[MaxN];

void Read();
void BFS(int x);

int main()
{
    Read();
    for(int i=1;i<=N;++i)
       d[i]=-1;

    BFS(S);

    for(int i=1;i<=N;++i)
        fout<<d[i]<<" ";
    fout<<'\n';

    fout.close();

    return 0;
}

void Read()
{
    fin>>N>>M;
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
        //G[y].push_back(x);
    }
    fin>>S;

    fin.close();
}
void BFS(int x)
{
    d[x]=0;
    Q.push(x);

    while(!Q.empty())
    {
        int x_nou=Q.front();
        Q.pop();
        for(auto y : G[x_nou])
            if(d[y]==-1)
            d[y]+=d[x_nou]+2,Q.push(y);
    }
}