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.

[[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
[-47, 0, -11, 6, 85, 50]

[[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[76, -40, 87, 30, 27, 27, 51]

[[63, -97, -69, 67, 34, -44, -120], [-115, -7, -121, -53], [-177, 61, -137, -123, -71, 22], [-78, -13, -42, -87, -115]]

[67, -7, 61, -13]