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.

Ex Input:
[[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]

Ex Output:
[74, -175, 67, 29, -7, 81]


Ex Input:
[[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

Ex Output:
[61, 17]


Ex Input:
[[-138, -87, -91, 9, 59, -51, -119], [5, -48], [-91, -104], [16, -108], [-51, -105, -147, -118, -129], [-69, 26, -198], [39, -128], [-88, -164, -168]]

Ex Output:

[59, 5, -91, 16, -51, 26, 39, -88]