int ini, fim;
vector<pair<int, int > > adj[100];
bool vis[100];

int bfs(){
    queue< pair< int , int> > q;
    q.push(make_pair(ini, 0));
    while(!q.empty()){
        int u = q.front().first;
        int d = q.front().second;
        q.pop();
        if(u==fim)
            return d;
        int t = adj[u].size();

        rep(i, 0, t){
            int v = adj[u][i];
                if(!vis[u])]{
                    q.push(mp(v, d+1));
                    vis[v]=true;
                }
        }
    }
    return INF;
}