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.
[[13, -115, -172, -91], [-53, -200, -164, -168], [-156, -50, -12, -17, 21], [62, -190], [14, 23, -26, -71, 62, 88], [-91, -197, 71, 67, 45, 75], [-179, -159, -57, 87, -106]]