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:
[[79, 50], [90, 81, -105]]

Ex Output:
[79, 90]


Ex Input:
[[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

Ex Output:
[23, 72, 76, 97, 79, 49, 32, -31]


Ex Input:
[[3, 92, -1, 15, 31, -60, 48], [31, -52, -183], [-150, -82, -82], [-57, -58], [-199, -54], [53, -161, -136, -1, -149, -150], [-89, -145], [54, -137, 46, 20], [-51, 38, 95, 58]]

Ex Output:

[92, 31, -82, -57, -54, 53, -89, 54, 95]