Given a sorted array of integers, find all the unique quadruplets which sum up to the given target.

Note: Each quadruplet must have elements [input[i], input[j], input[k], input[l]], such that i < j < k < l. The ordering of unique quadruplets within the outputlist does not matter.