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.
[[-115, 29, -71], [72, 29, -87, -112, 99], [-187, -127], [0, 68, -190, -94, -129, 37], [-118, -69, -197, -191, -127, -29, -23], [34, -17, -199, -116, 3, -28, 84], [10, -35, 61, -114, 90, -80], [4, -16, 17, 43, -65, -61, -143], [-139, -73]]