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:
[[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

Ex Output:
[74, 78, -132, 63, 73, 39]


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:
[[13, -188, 91, -25, -102, -29, -186], [38, 85, -4], [-102, 67, -169, 19, 96, 11], [-117, 57, -197, -163, -120], [42, 16, -112], [-53, 25, 61, -46, -4], [8, 14, -47, -68, 70], [-106, -173, -113, -177, -185, -192]]

Ex Output:

[91, 85, 96, 57, 42, 61, 70, -106]