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.
[[32, -67, 59, 53, 80, -102], [-86, -59, 31], [7, -87, 63, -51, 100, 59], [1, 66, 76, 66, -21], [-71, 25, -1, 0]]