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.

15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']
34357

2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']
10176

3, 7, ['O', '8863', '2403', '6505', 'q', 'S', 'L', '6033', '9717', '9375', 'N']

8908