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

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