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:
[[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]
answer:
[-7, 1, 54, 9, -14, 94, 14, -83]


question:
[[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
answer:
[99, 32]


question:
[[-138, -158, 66, 78, 93, 61], [-25, -149, -157], [-107, -159, -46, -133, -24], [-127, 59], [-39, -168, -131, -60], [-40, 39, -180, -111, -102, 39], [-144, -163, -143]]
answer:

[93, -25, -24, 59, -39, 39, -143]