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.
[[-141, -55, 55, 81, 61, 3, 79], [-48, -81, -58], [-27, -114, -39], [9, 37], [42, -68, 3, 80], [-11, -157, -182, -103, -114], [-165, -189, -38, 26], [-92, -124], [-169, -180, -51, 91, 23, 34, 66]]