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.
[[-109, 72, -177, -172, -82, 70], [26, -94, -122, 76, -10, 89], [-66, 55, -197, -94, -42, -64, -159], [-83, 10, 70, -27, 17], [-159, -116, -72, -157, -115], [-160, 37, -197, -50], [74, 44, 81, -54, -135, -168], [67, -56, -32], [-66, -109, -188, -112, -50, -75]]