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.
[[-24, 89, -56, -61, 26], [-172, 54, 21, -198, -143, 10], [15, -68, -161, -126, -124], [-193, 48, -200, 16, 5, -57, -63], [-29, 92, -106, -2], [-60, 68, -65, -38, -16], [85, -119, -83], [82, -165, -155, -103, -10, -36, 69]]