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, 14, ['K', 'M', '881', '9687', '1979', 'i', '3643', '9769', 'O', '6405', '2617', 'X', 'b', '9219', 'g', '4511', 'L', '3685', 'r', '6927', 'r', 'v', 'y', 'p']