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.
2, 19, ['r', '3251', '2263', '9635', 'a', 'J', '6469', 's', 'J', 'r', 'C', 'D', 'l', 'n', '6647', 'x', '9473', 'o', '9535', 'Y', '9399', '2135', 'B', '8489', '4133', 'd']