#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#pragma GCC optimize("O1")
using namespace std;
FILE *fout=fopen("bfs.out","w");
const int nmax=100005;
vector <int> g[nmax];
vector <int> viz(nmax,-1);
int n,m,s,poz;
class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if (sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while (isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        return *this;
    }
};
void BFS(int s)
{
    queue <int> q;
    q.push(s);
    viz[s]=0;
    while(!q.empty())
    {
        int v=q.front();
        for(unsigned int i=0; i<g[v].size(); i++)
            if(viz[g[v][i]]==-1)
            {
                viz[g[v][i]]=viz[v]+1;
                q.push(g[v][i]);
            }
        q.pop();
    }

}
int main()
{
    InParser fin("bfs.in");
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x=0,y=0;
        fin>>x>>y;
        g[x].push_back(y);
    }
    BFS(s);
    for(int i=0; i<n; i++)
        fprintf(fout,"%d ",viz[i+1]);
}