#include <fstream>
#include<vector>
#include<deque>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,i,x,y,d[100001];
vector<int>v[100005];
deque<int>q;
void bfs(int n, int d[],int st)
{
    q.push_back(st);
    d[st]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop_front();
        for(int i=0;i<v[nod].size();i++)
            if(d[v[nod][i]]==100005)
            {
                d[v[nod][i]]=d[nod]+1;
                q.push_back(v[nod][i]);
            }
    }
}
int main()
{
   f>>n>>m>>s;
   for(i=1;i<=n;i++)
    d[i]=100005;
    while(m--)
   {
       f>>x>>y;
       v[x].push_back(y);
   }
   bfs(n,d,s);
   for(i=1;i<=n;i++)
   if(d[i]==100005)
    g<<-1<<" ";
   else
    g<<d[i]<<" ";
    return 0;
}