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.

[[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]
[69, 65, -70, 55, 46, 38]

[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[65, 67, 98, 47, 76, -16, 91, 64]

[[-31, -193, 70, 56, 2], [21, -69, -110, 32, -117], [-9, 59, -111], [-78, -67, -94, 13, 1, 54], [-62, -45, -149, -66], [70, 71, 95, -32, 67, -84], [-120, 94, -12, -13]]

[70, 32, 59, 54, -45, 95, 94]