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.
[[-44, 100, -29, 42, -31, -26, -109], [-29, 0, -114, -160, -177, -9, -25], [-145, 48, -166, -148], [79, 87, 67], [-53, -94], [-29, 67], [-152, 63, -128, 24, -57, -57], [1, 53], [-116, -14, -59, -7, -77, -166]]