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:
[[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

Ex Output:
[25, 59, -59, 90, 68, -84]


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:
[[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

Ex Output:

[36, -23, 76, 20]