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.
[[-160, -20, -12, -29], [-114, -46, -127, -3], [-124, -23, -107], [79, -55, 55, -60, 37, -17, 23], [1, -182, -163, -150], [-88, 39, 11, -162], [46, -82, -60, -14, 41, -160, -166]]