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.
[[96, -3, -77, -95, 59, -151], [90, 91, 19, 10], [-99, 80, -140], [55, -171], [-136, -33, -42, -90, 46, -35, 93], [-86, 48, -179, 81, 33, 2], [-44, -39, -186, -102, 70, 87, -31], [-102, -145, -170, 65, -57, -58], [-152, 75, -85, -113]]