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.
[[-36, -74, 24, -99, -93], [-2, 53, 68, 17, -198, -101, -188], [-110, -128, -155, -41, -25, -109, -72], [-39, -171], [-19, -89, -66, -67, -113, -58], [83, 31], [-187, 79, -181]]