#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> lista[100010];
int height[100010];
void bfs(int startIndex)
{
    queue<int> cue;
    height[startIndex]++;
    cue.push(startIndex);
    while(cue.size())
    {
        int currentNode = cue.front();
        for(int i = 0;i<lista[currentNode].size();i++)
        {
            if(height[lista[currentNode][i]]==0)
            {
                cue.push(lista[currentNode][i]);
                height[lista[currentNode][i]] = height[currentNode]+1;
            }
        }
        cue.pop();
    }
}
void addVertex(int x,int y)
{
    lista[x].push_back(y);
}

int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    for(int i = 0;i<m;i++)
    {
        fin>>x>>y;
        addVertex(x,y);
    }
    bfs(s);
    for(int i = 1;i<=n;i++)
        fout<<height[i]-1<<" ";
    return 0;
}