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.
[[62, -51, 53, -39, 100], [0, -144, 94, 12, -131, -135, 92], [-151, 6, -26, 27, 2, -8, 81], [-12, -189], [-54, 33, -111, -64, 90, 66], [-139, -91, 7, 66, 12], [20, -142], [-184, -109, -193, -72, -63]]