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:
[[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]]
answer:
[72, 77, 74, 24, -168, -8, 64, 59, 45]


question:
[[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]
answer:
[93, 57, 98, 60, 15, -64, -9]


question:
[[-26, -94, -15, 91, 81], [1, 91], [-50, 88, -44], [44, 34, -139, -7, -122, -72], [-107, 25], [-74, -45, 55, 2, -83]]
answer:

[91, 91, 88, 44, 25, 55]