In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
14, 17, ['k', 'P', '3271', 'n', '4359', '9399', 'x', '2209', 'i', '1167', 'I', 'u', '2937', '8887', '2133', 'c', 'Y', 'U', 'G', '8455', '3695', 'M', 'Y', 'z', '9479', 's', '6931', '171']