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.
[[55, -26, -162, -58, -176, -121], [-45, 0], [-31, -198, 14], [40, -195, -172, 43, -131, -22], [-198, 80, 10, 7], [-82, 94, 49, -115, -183], [-30, 15, -79, -39, 24], [-20, 19, -87, 57]]