You will be given a definition of a task first, then some input of the task.
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.

[[-112, -41, -140, -32, -198], [-5, -188, 79, -156, -116, -49, 98], [-115, -96], [87, -79, 47, -144, -122, -104, -90], [-69, 25, 7, 61, -18, -99, -25], [-21, -106, -155, -116, 6, 93, -60], [-31, -100, -14, -152], [52, -192, -175, -45, -158, -33, 65], [27, 5]]
Output:
[-32, 98, -96, 87, 61, 93, -14, 65, 27]