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.
[[51, -38, -30, -59, -97, -189], [10, -136, -99, -41], [-160, -116, 75, -41], [-108, -101, 72, -6], [-144, -40, -175, -62, -176, -29], [-163, 99, -122, -138, 63, -70], [66, -120, -29, -22, -70, -157], [64, -174, 84, 17, -106]]