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:
[[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
answer:
[-6, 36, 29, -46, -41, 35]


question:
[[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]
answer:
[65, 53, 72, -30, 85, 38]


question:
[[-161, 29, 78], [-174, 22, 8, -157, 9, -169, -47], [15, -19], [98, 64]]
answer:

[78, 22, 15, 98]