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.
[[4, -123, -158, -91, -141, -59], [-144, 8, -32, -172, 17, -165, -42], [61, -199, -100, 49, 76], [-44, -176, -51, -29, -118, -136], [-63, -171], [95, -120], [39, -100, 43, -160], [-200, -145, -109, -10, 62, -145], [85, -176, 65, 70]]