#include <fstream>
#include <vector>
#include <queue>
#define miel 100005
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int>v[miel];
queue <int> q;
int n,m,i,x,y,sursa,lg[miel];
bool used[miel];
void bf(int sursa)
{lg[sursa]=0;
used[sursa]=true;
vector <int>::iterator it;
q.push(sursa);
while (!q.empty())
{int x=q.front();
    q.pop();
    for (it=v[x].begin();it!=v[x].end();it++)
    if (!used[*it])
    {q.push(*it);
        used[*it]=true;
        lg[*it]=lg[x]+1;
    }
}
}
int main()
{f>>n>>m>>sursa;
for (i=1;i<=m;i++)
{f>>x>>y;
    v[x].push_back(y);
    lg[i]=-1;
}
bf(sursa);
for (i=1;i<=n;i++) g<<lg[i]<<" ";
}