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.
[[-23, -9, -25, 34, -127, -36], [-192, -82, 58, 37, -8], [-15, 31, 11, -39, -106, -109], [-52, -109, -73, 85, -31, 84, -164], [-34, -23, -116, -87, -2, 83, -130], [-155, -129, -176, -77, -137, -133, -138], [-178, 29, -65, -164, -23, -141, 33], [-24, -63, -40, 12, -170, -111, -141]]