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:
[[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]
answer:
[31, -1, 65, -15, -38, 59, -23]


question:
[[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]
answer:
[-35, 73, 58, 72]


question:
[[97, -182, -63, -148, -123, -20, 9], [-167, 39, -163, -90, -123, -90]]
answer:

[97, 39]