#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[100005];
queue <int> q;
int i,n,m,s,x,y,d[100005];
void bfs(int s)
{q.push(s);
d[s]=1;
while(!q.empty())
    {int nod=q.front();
    q.pop();
    for(int i:v[nod])
        if(!d[i])
            {q.push(i);
            d[i]=d[nod]+1;
            }

    }

}
int main()
{f>>n>>m>>s;
for(i=1;i<=m;i++)
    {f>>x>>y;
    v[x].push_back(y);
    }
bfs(s);
for(i=1;i<=n;i++)
    g<<d[i]-1<<" ";

}