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.

[[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
[55, 51, 83, 61, -9, 67, 15]

[[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]
[36, 40, 84]

[[-23, -38, -35, -71], [-154, -13, -140], [-18, 79, 32, 5, 40], [-174, 86, -26, 87, -128, -112], [-128, -37, -164, 3], [60, -75], [35, -43, -176, -55, -112, 5], [8, 55, -154]]

[-23, -13, 79, 87, 3, 60, 35, 55]