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:
[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

Ex Output:
[33, 34, 68, -13]


Ex Input:
[[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]

Ex Output:
[-105, 97, 59, 80, -47, -51, 9, 70, 81]


Ex Input:
[[-83, -90, -129, -159], [-64, -72, -85, -165, -132, -101], [-168, 10, -148, -184], [-156, 0, 74, -135, 13], [-40, -196, -177, 32, -43, 30], [-198, -147, -183, 23, -97, 49, 65], [13, -52, -39, -74, -41, -102, -57], [35, -39, -29, -86, 44, -85, 70], [-154, -123, 2, -42]]

Ex Output:

[-83, -64, 10, 74, 32, 65, 13, 70, 2]