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:
[[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
answer:
[12, -10, -48, -35]


question:
[[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
answer:
[82, -53, 34, 100, 65, 57, 65, 58, -101]


question:
[[31, -134, 49, -176, -91, -21, -199], [-180, -145, 0, -172, 5, -18, 27], [81, -196, 55, -145, 53, -93, 24], [55, 36, -60, -40, -79, -43, 17], [-53, -106, -181, -100], [-144, 31, -51, 34, 87], [-61, -188, -70, 45, -119]]
answer:

[49, 27, 81, 55, -53, 87, 45]