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, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]

Ex Output:
[72, 77, 74, 24, -168, -8, 64, 59, 45]


Ex Input:
[[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]

Ex Output:
[97, 45, 26, -42, 45, 44, 27, -42]


Ex Input:
[[84, -132, -90], [98, 48, -192, -41], [-178, 26, -127], [18, -152, 21], [-153, -149, 81, -199, -164, 72, -40], [4, 81, 30], [-16, 46, 13, 75], [-166, 15, 89, -105, -19], [-11, 26, 60, -7, -37]]

Ex Output:

[84, 98, 26, 21, 81, 81, 75, 89, 60]