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.

[[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[83, 59, 65, 56, 83, 99, 98, 15, 82]

[[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]
[-30, 68, -15, 38]

[[-178, -112], [-52, 29, 20], [43, -189, 94, 10, -145, -123, -18], [76, -111, 86, -84, -72, -150, -195], [89, 33, -94], [-22, -64, 24, -145], [-10, -10, -6, -113, -58, -84], [-54, -146, -188]]

[-112, 29, 94, 86, 89, 24, -6, -54]