#include <fstream>
#include <queue>
#include <vector>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

queue <int> q;
vector <int> a[100001];
int n, m, s, d[100001];

void bfs(int x)
{
    int y;
    unsigned int i;
    q.push(x);
    d[x]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            if(!d[y])
            {
                q.push(y);
                d[y]=1+d[x];
            }
        }
    }
}

int main()
{
    int x, y, i;
    in>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++) out<<d[i]-1<<" ";
    return 0;
}