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, 26, ['Q', '9923', '4811', '9565', 'x', 'B', '1397', 'g', '5155', 'N', '7891', 'V', '6925', '5023', '4571', '2211', '5603', '2255', 'M', 'b', 'Z', '6893', '8579', '4017', 'I', 'r']