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:
[[-19, -151], [33, 54, 85]]

Ex Output:
[-19, 85]


Ex Input:
[[51, 69, 16, -10, -129, -67], [-103, -143, -154, -20, -98, -18, -185], [-10, -134, 18, 0, -167, -168, 42], [-129, -8, -71], [10, 25, -159, -150, -71], [100, 69, -89, -138, -160, -199, 18], [21, 90, 46, -78, -146]]

Ex Output:

[69, -18, 42, -8, 25, 100, 90]