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

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int N=100005;
int viz[N];
vector<int> v[N];
queue<int> q;

void bfs(int nod)
{
    int x;
    q.push(nod);
    viz[nod]=1;
    while(q.empty()==0)
    {
        x=q.front();
        q.pop();
        for(int y:v[x])
        {
            if(viz[y]==0)
            {
                viz[y]=viz[x]+1;
                q.push(y);
            }
        }
    }
}

int main()
{
    int n, m, s, a, b;
    cin >> n >> m >> s;
    for(int i=1; i<=m; i++)
    {
        cin >> a >> b;
        v[a].push_back(b);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
    {
        cout << viz[i]-1 << " ";
    }
    return 0;
}