#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define len(a) (int) (a).size()

#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1e5+3;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;

/*===================*\
      comentarii:
\*===================*/

using namespace std;

int n,m,s;
vector<int>v[nmax];
vector<int>d(nmax,-1);
queue<int>q;

void bfs()
{
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i];
            if(d[vecin]==-1)
            {
                d[vecin]=d[nod]+1;
                q.push(vecin);
            }

        }
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    while(m--)
    {
        int x,y;
        fin>>x>>y;
        v[x].pb(y);
    }
    d[s]=0;
    q.push(s);
    bfs();
    for(int i=1;i<=n;i++) fout<<d[i]<<" ";
}