In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[43, 30], [-5, -86, -180, -8, 72], [-198, -109, -189, 4, -87, 91], [-196, 50, -7, -1], [-45, -145, -19, -105, -192, -120], [70, -113, 55, -140, -128], [-155, -99, -100], [-6, 42, 86]]