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.
[[89, 71, 56, 44, 66], [-42, 32, 54, -12, -155], [-73, -144, 79, -31, -178], [-16, -184, 57, 1, 53, 42], [61, -77, 13, -58, -161], [-48, 53], [48, 32, -13], [53, 32, -62, 87, 89]]