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.
[[31, -130, -180, -98, 12, 82], [49, -11, -12, -197, -191, -183], [-115, -22, 30, -13], [-47, 83], [-49, -83, 41, 38, 36, -147, -126], [-134, -198, -18, -144, -176, -75], [94, -121], [-41, -124, -180, 29, -22]]