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.
[[50, -106, 74, -29, -57, -18, 88], [-165, -44, -83, 23, -133, -10], [70, -144, -172], [-113, -130, -17], [-103, 94, 60, -40, -190, -59], [-114, 32, -10], [-190, 54, 44, -56, -60, -31], [9, 42, -148, -9, -133, -158, -45], [-18, 36, 78, -79, -177, -136]]