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.

Example Input: [[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
Example Output: [75, 5, 96, 58, 93, -49, -5, 82, 92]

Example Input: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
Example Output: [63, -33, 43, 68]

Example Input: [[29, -34, -185, 64], [-17, -94], [-110, -72, -67], [-197, -76, 14, 82, -28], [-52, -165, 33, -113], [4, -88, 8, -105, -13, -106], [40, 86]]
Example Output:
[64, -17, -67, 82, 33, 8, 86]