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.

[[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]
[-6, -59, 52, 14, 96, 37, 62]

[[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]
[25, 54, -45, 79, 96]

[[-130, -192, -113, -67, -91, -98], [-36, 54, -161, -126, -51], [72, -2, -71], [-6, 56, -30, 67, -6], [-79, 5], [91, -143, -157], [-131, 29], [-181, -32, -118, 38, -181, -184], [-59, -128, -60, 51, 5, 63]]

[-67, 54, 72, 67, 5, 91, 29, 38, 63]