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.
[[81, -66], [15, 36, -141, -128, -9, 63, 6], [-131, -78, -12], [-61, -45, 87, -14, 57, -112, -32]]