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:
[[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]
answer:
[44, 72, 91, 14, 85, 99, 81]


question:
[[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
answer:
[-7, 71, 29, 59, 93, 71]


question:
[[-150, -146, -123, 39, 76, -99, 13], [-58, 95, -13], [-108, -171, -144, 86, -148], [-153, -158, 59, -106, 36, 64, -183], [-107, -106, -104, -58, -77, -19, -94], [-157, -13], [-49, -97, 70], [24, -126, -199, -146], [-61, -58, -54, 56, -22, -141]]
answer:

[76, 95, 86, 64, -19, -13, 70, 24, 56]