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.
[[-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]]