#include <fstream>
#include <vector>
#include <queue>
#define NM 100005
#define pb push_back
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,nod;
int nrpasi[NM];
vector <int> v[NM];
queue <int> coada;
void BFS()
{   nrpasi[nod]=1;
    coada.push(nod);
    while(!coada.empty())
    {   int x=coada.front();
        coada.pop();
        for(unsigned int j=0; j<v[x].size(); j++)
            if(!nrpasi[v[x][j]])
            {   nrpasi[v[x][j]]=nrpasi[x]+1;
                coada.push(v[x][j]);
            }
    }
}
int main()
{   f>>n>>m>>nod;
    while(m--)
    {   int x,y;
        f>>x>>y;
        v[x].pb(y);
        //v[y].pb(x);
    }
    BFS();
    for(int i=1; i<=n; i++) g<<nrpasi[i]-1<<' ';
    return 0;
}