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.
[[39, 66, 55, 35, -103, -46], [-69, 81, 71, -25, 50, 83], [-118, -166, 54, 55, -188, -124, -67], [99, 10, -77, -38], [-62, -148, -114, -29, 45], [-189, 2, -66, -45, 13, -183, -125], [-115, -32, 14, -64], [-87, 97, -160, -10, 25]]