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.
[[2, 38, -189, -184, -129, 31], [-97, -104, 18, -88, -188, 79], [-59, -11, 2, 49, -4], [53, -24, 35, 28, -185, 88], [-191, -198, 83, -181, -96, -97], [53, 36, -111, 26, -45, -101]]