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.
[[-21, -123, -165, -188, 39], [76, 10], [78, -89, 14], [-35, -166, -40, -119, 5, -117], [-91, -198, -132, -163], [-124, 19, 50, -64, -97, -86, 55], [-64, -183, 67, -40, -82, -181]]