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.

[[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]
[-29, 69, 1, 54, 52]

[[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
[-2, 31, 57, 0, 55, 94, 49, 57, 9]

[[21, -29, 97, -110, -171, -181], [65, -105], [-78, 66, -143], [-21, -89, 54, -79, 83], [-130, -50], [-64, 18, -15, -113, -7, 37, -29], [-62, -127, -112, -158], [-123, -15, -65, -171]]

[97, 65, 66, 83, -50, 37, -62, -15]