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.
[[5, -16, -154], [-38, -13, -20, -138, -175, -87], [36, -110], [-102, -175], [26, -58, 82, -39, 2, -28, -169], [-175, -193, 7, -63, -187, -183], [-193, -108, -65, -3, -72, -50, 50], [-87, 90, -48, -122], [-59, 16]]