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:
[[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]
answer:
[99, 54, 32]


question:
[[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
answer:
[71, 71, -38, 60, 7, 97, 76]


question:
[[-60, 60, -104], [-50, -83, -64, 86], [26, -131, -100, 29, -111], [10, -15], [-48, -133, 3, 1, -154, -118, 45], [50, 77, -59, -9, -125, 55], [60, 65, -1], [-122, -75, -131, 87, -195, 66, -11], [22, -89]]
answer:

[60, 86, 29, 10, 45, 77, 65, 87, 22]