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.
12, 25, ['D', '5693', 'X', 'U', 's', '3297', 'p', '7071', '5381', 'C', '6267', 'S', 'O', '969', 'h', 'B', 'J', '7311', 'p', '4537', 'R', 'Y', 'h', '6383', '4985', '527', 'M', '7395', '9481', '9029']