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.
[[-181, -193, -177, -37, 86, -146, -134], [-105, 90, -58, 18], [-151, -143], [-143, 64, 52, -32, -153, -177], [-143, -10, -158, 16, -135, -30], [-12, -38, 98, -50, -9], [-21, 24, -126]]