#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int> v[100010];
queue<int> q;
int n,m,s,d[100010],x,y;
int main()
{
    f>>n>>m>>s;
    for(;m;m--)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    d[s]=1;
    q.push(s);
    while(q.size())
    {
        x=q.front();
        q.pop();
        for(auto i:v[x])
            if(!d[i])
            {
                d[i]=d[x]+1;
                q.push(i);
            }
    }
    for(int i=1;i<=n;i++)
        g<<d[i]-1<<' ';
    return 0;
}