Problem

You are given an array of length n. You need to find all the subsequences of the same length m, and then calculate the score of the subsequence as the product of the first and last element of the subsequence. Return the minimum possible score of any subsequence.