#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[1000000];
int n,i,j,k,t[1000000],lg[100000],s,x,y,q[100000];
bool ok[100000];
void bf(int nod)
{int p=0,u=0;
vector <int>::iterator it;
ok[nod]=true;
q[++p]=nod;
u=1;
while (p<=u)
{x=q[p];
    for (it=v[x].begin();it!=v[x].end();it++)
    if (!ok[*it])
                {q[++u]=*it;ok[*it]=true;
                 t[*it]=x; lg[*it]=lg[x]+1;
                }
p++;

}

}
int main()
{f>>n>>k>>s;
for (i=1;i<=k;i++)
{f>>x>>y;
    v[x].push_back(y);
}
bf(s);

for (i=1;i<=n;i++) if (lg[i]!=0||i==s) g<<lg[i]<<" ";
                    else g<<"-1"<<" ";

}