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.
[[-123, -130, -132], [3, -150, 3, 38, -19, -86], [-154, -191, -55, 59, 87], [-110, -162, -182, -16, -138, -33, 27], [-135, 8, -49, -126], [10, 15, 7, -4, -59], [65, 7, -9, -10]]