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:
[[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]

Ex Output:
[24, 48, 2, 1, 18]


Ex Input:
[[-145, 1], [59, 75, 59, -143, -134], [-27, -26, -31, -75, -32, 55, -174], [-37, 28, -11, -168, -161, 67], [-112, -26, -121], [75, 56, -57, 37], [51, -71, 50, -67], [-160, -85, -1, -181], [91, -67]]

Ex Output:

[1, 75, 55, 67, -26, 75, 51, -1, 91]