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.

7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
0

2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']
33351

2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

1351