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:
[[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]

Ex Output:
[90, 65, 16, 93, 30]


Ex Input:
[[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]

Ex Output:
[49, 68]


Ex Input:
[[-121, 35, 15, -168, 65], [62, -41, 34, -126], [79, -176, -191], [-88, -39, -51, -146], [-148, -45, 88, 61, -151], [-23, -167, -149, -138, 72, -39], [-163, 90, 3, -124], [-36, -128, 2, -50, -91]]

Ex Output:

[65, 62, 79, -39, 88, 72, 90, 2]