def find_min_flow_on_path(adj_l, path):
    """Find min flow on path"""
    min_flow = float('inf')
    for i in range(len(path) - 1):
        curr = path[i]
        next = path[i + 1]
        min_flow = min(min_flow, adj_l[curr][next])
    assert min_flow > 0, f"{min_flow}\n{path}\n{adj_l}"
    return min_flow