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.

[[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]
[99, 48, 31, 77]

[[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]
[75, 70, 47, 87, 37, 72, -12, -5, 76]

[[-47, -130], [44, -155, 62, -176, -123, -94], [41, 18, -70, -75, -80, 33, 81], [88, 62, 40, -168, -158], [-139, -109, -146, -43, -109, -172], [-165, -168, 70, -55, -100, -137, -197], [17, 41, 58, 69, -155], [34, -146], [86, 70, -143, -63, -65, -112]]

[-47, 62, 81, 88, -43, 70, 69, 34, 86]