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.

Input: Consider Input: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Output: 0


Input: Consider Input: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

Output: 17181


Input: Consider Input: 4, 20, ['1699', '6867', 'H', '6999', '4493', 'N', '373', 'b', '7239', 'E', '9377', 'R', '9911', 'E', '2255', 'h', '7625', '8593', 'd', '8755', '6009', 'b', '615', '8381', 'd', '8061', 'S', 'O']


Output: 65620