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.
[[68, -136, 36, -138, 9], [9, -66, -121, 73], [-136, -199, -26, -153, 89, -157], [-186, 9, 49, -184, -124], [87, 61, -46], [-50, -15, 12, -95, -154, 96, -13], [-198, -89, -163, -171, 0], [20, -37]]