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.
[[37, -26], [50, -32, -1, -46, -12, -70, 40], [-105, -121], [-38, 29, 25], [31, -183, -170, 81], [73, -199, 61, -169, -37, 96], [-181, 78, -146], [-82, 36], [-99, 45, -146]]