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:
[[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Ex Output:
[28, 70, 52, 63, -145, 11]


Ex Input:
[[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]

Ex Output:
[98, -11, 98, 26, 10]


Ex Input:
[[68, -136, 36, -138, 9], [9, -66, -121, 73], [-136, -199, -26, -153, 89, -157], [-186, 9, 49, -184, -124], [87, 61, -46], [-50, -15, 12, -95, -154, 96, -13], [-198, -89, -163, -171, 0], [20, -37]]

Ex Output:

[68, 73, 89, 49, 87, 96, 0, 20]