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.
[[-199, -31, 26], [67, 35, 70, -1, 30, 57, 14], [9, -108, 0, -184, -35], [50, 50, -64, -183], [-29, -51, -34, -198, 3, 67, -188]]