#include <fstream>
#include <deque>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

deque <int> q;

int n,m,a[1001][1001],viz[100010];

void bfs (int s)
{
    int i,val,nod;
   q.push_back(s);
    viz[s]=1;

   while(q.size()!=0)
   {

    nod=q.front();

    val=viz[nod]+1;
    for(i=1;i<=n;i++)
        if(viz[i]==0&&a[nod][i]==1)
        {

            q.push_back(i);
            viz[i]=val;
        }

    q.pop_front();
   }

}
int s,i,x,y;
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][y]=1;
    }
    for(i=1;i<=n;i++)viz[i]=0;

    bfs(s);

    for(i=1;i<=n;i++)
        g<<viz[i]-1<<" ";
    return 0;
}