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.
[[-124, 60, 60], [-11, 49, 97, 51], [-59, -167], [-49, 65, -191, -184], [-3, -159, -90, 56, 36], [17, 89], [92, -12, -99, -54, -8, -30], [30, -51, 89, 78, -26], [11, -135, -146, 71, 39]]