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:
[[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

Ex Output:
[45, 17, 92, 12, 28, 8, -93]


Ex Input:
[[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

Ex Output:
[89, 96, -69, 40, 90, 75, 99, 98, 41]


Ex Input:
[[-194, 100, -161], [48, 83, -10, -113, 22, 71, -42], [13, -115, 96, 56, -73, 61], [-126, -52, -164, -91], [-99, -176, -164, -56], [-53, -146, 22], [-157, -105, -123, -27, 60, -14, -65]]

Ex Output:

[100, 83, 96, -52, -56, 22, 60]