#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<vector<int> >arr(100000);
int ari[100001];
int vf[100001];

void bfs(int s)
{
    queue<int>q;
    q.push(s);
    while (q.empty()==0)
    {
        int x=q.front();
        q.pop();
        for (int i=0; i<arr[x].size(); i++)
        {
            int y=arr[x][i];
            if (vf[y]==0)
            {
                vf[y]=1;
                ari[y]=ari[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;
        arr[a].push_back(b);
    }
    vf[s]=1;
    ari[s]=0;
    bfs(s);
    for (int i=1; i<=n; i++)
    {
        if (ari[i]==0&&i!=s) cout<<"-1 ";
        else cout<<ari[i]<<" ";
    }
}