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.

[[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[0, -131, 75, 100, 90, 95, -24, 13, 10]

[[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]
[-139, 92, 69, 96]

[[-119, -4, 61, 80, 17], [-145, 0, -92], [-136, -153, -179], [-52, 31], [92, 29, 56, -74, 2, 22, -200], [43, -57, -132, 23], [-17, -148, 61], [1, 9, 59, -67]]

[80, 0, -136, 31, 92, 43, 61, 59]