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.
[[-113, -134, -79, -180, 37], [-71, -135], [-15, -28, -101, -71], [-97, -200, -179, 91, -154, 40], [10, -180, -196, -191, 31, 89, -123], [-182, 30, -97, -39, -41, -44, 82], [75, 60, -84, 93, -147, -42, -89], [77, 69, 43], [82, 61]]