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:
[[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
answer:
[75, 95, 70, 68, 100, -2, 15, 32, 97]


question:
[[44, 37, -10, 4, -109, 87], [-62, -48, 51, -171, -162], [-41, 10, -49, -32, -116], [89, 100, -192, -33, -41, -17, -19], [86, 16], [-92, -131, 2, -25, 10, -84, -124], [-119, 77], [58, 23], [-103, -64, -166, 74]]
answer:
[87, 51, 10, 100, 86, 10, 77, 58, 74]


question:
[[-21, -123, -165, -188, 39], [76, 10], [78, -89, 14], [-35, -166, -40, -119, 5, -117], [-91, -198, -132, -163], [-124, 19, 50, -64, -97, -86, 55], [-64, -183, 67, -40, -82, -181]]
answer:

[39, 76, 78, 5, -91, 55, 67]