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.
1, 1, ['R', '1669', '7129', 'h', '5617', '4741', 'y', 'm', '4499', 'K', 'L', '9283', '2785', '3913', 'p', 'f', 'j', '7853', 'E', '3181', 'Y', 'M', 'U', 'Q', '2823', '133', 'd', '7145']