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.
[[90, 8, -21], [37, 98], [20, -144, 46, 19, -148, -166, -26], [-16, 59, -178, 97], [-10, -187, -97, -144, -189, -45, -172], [-157, 89, -76, 15], [-74, 14, -49, -85, -13, -111, -35], [-130, 55, -2, 76], [97, -129, 84, 100]]