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:
[[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

Ex Output:
[76, 28, -16, 28, 74]


Ex Input:
[[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

Ex Output:
[92, 50, -48, 70, 50, 30, 14, 7, 62]


Ex Input:
[[-56, 94, -75, -163, -131, -41], [53, -98, -169], [-40, -59, 78, -179, 74, -147], [33, 9, 40, 10, -39], [-111, -153, -58, 44, -136]]

Ex Output:

[94, 53, 78, 40, 44]