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, -81, 18, -177, 2, 5], [-168, 48, 70], [-85, -185, -62, -23], [-151, -17, 36, -75, -197, -19], [-192, 32, -20, -92, -51, -105, -173], [-59, 82, -198], [-188, -38], [40, -129, -99, 32], [-71, 35, -188, -191, 52, -179]]