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.
[[-176, 2, 81, -21, 67, -39, 34], [-129, 92, -73], [20, 36, 70, -60, -47, -156], [-81, -5, -15, 38, -174, 26], [-154, -57, -135, -173, 68, -8, -187], [-181, -141, -72, 52, -84, -122], [42, 36, -40, -112, -10], [54, 23, -66, -54]]