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, -6, 15, 6, -155, -188, -81], [-133, -100, -72], [-116, 67, -15, -197, -91, 51]]