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, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]

Ex Output:
[55, 94, 89, 30, 77, 87]


Ex Input:
[[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

Ex Output:
[75, 34, 96, 33, 21, 50, 17]


Ex Input:
[[-2, -70, 93, -119, -164], [-170, -122, -89], [-19, -163, -113, 25], [-131, -55, 47, -113], [51, -13, -200, -125, -2, -83, -48], [-78, 15, -36, 97, -158, -74, -24], [70, -70, -108, 67, 57], [51, -48, -199, -91, -83, -60], [-78, 14, -7]]

Ex Output:

[93, -89, 25, 47, 51, 97, 70, 51, 14]