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.
[[-29, -103, -189, -161, -144, -107, 13], [-149, -26, -89], [1, 32, -90, 64, -172, -28, 31], [-60, -55], [-83, -186, 51, 64], [-67, -17, -186], [91, -126]]