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.

[[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]
[82, -62, 5, 98, 100, 56, 64, 54]

[[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[53, 41, 80, 98, 91, 62]

[[23, -139, -63, -77, -26], [54, -45, 13, 43, -168, -41, 90], [-103, 19, -95, -116, -68], [-144, -131, -168, 45, 92, -60, -98], [5, 10]]

[23, 90, 19, 92, 10]