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:
[[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

Ex Output:
[60, -32, 68, 93, 24, 26, 7, 85]


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:
[[-24, -113, -167, 38, 19, -52, 96], [-113, -138, 57, -164, 84, -147], [-29, 68, -39, 56], [-99, -33, -53, -102, -105, 97, 39], [-54, -59, -75, 47, -182, -24, -113], [27, -8, 73, -116], [-137, -8, -83, 42, 79], [-170, 0], [37, 79, 94]]

Ex Output:

[96, 84, 68, 97, 47, 73, 79, 0, 94]