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.
[[41, 12], [-200, -101, -182, -38, -11], [84, 47], [-129, -104, -47], [43, 13, 12, 41], [10, -108, 65, 93]]