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.
[[80, -47], [-126, -26, -146], [-31, 20, -25, 42, 32, -146, -45], [76, -113, 53, -184, -8, 86], [-37, -69, -17, -193], [-4, -50], [15, -102, -59, 33, -41]]