instruction:
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.
question:
[[-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]]
answer:
[75, 34, 96, 33, 21, 50, 17]


question:
[[-92, 66], [-124, -75, -170, -17, 20, -164]]
answer:
[66, 20]


question:
[[-89, -31, -19, -33], [-24, -168, 91], [-16, -77], [-58, -124, 6], [-6, -134, 39, -167], [-163, -34, -4, 26, 66], [-88, -100, -197, -115], [-35, -154]]
answer:

[-19, 91, -16, 6, 39, 66, -88, -35]