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.
[[-14, -116, 26, -90, 19, -26], [-99, 26, -176, 22, -51, -46, 35], [-104, -39, -9], [-33, -199, -189]]