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, -195, -34, -174, -36], [-161, -23, -144, -65], [-106, 86, -133], [-160, 65, -50], [-48, -73, 100, -56, -184], [30, -117, 59, 25, -54, -80]]