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:
[[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

Ex Output:
[98, -25, 42, -101, 76, 92, 82, 53, 53]


Ex Input:
[[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

Ex Output:
[-84, 64, 62, -1, 88, -71]


Ex Input:
[[-72, 32, 74, -114, 40, 64], [-77, 91, 95, 70, -20], [36, 73, -132], [-156, -114, -162, -58, -128, 79], [-176, -158, -60, 82, -30, 60, -139]]

Ex Output:

[74, 95, 73, 79, 82]