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.

Q: 15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']

A: 40552
****
Q: 2, 2, ['E', 'i']

A: 0
****
Q: 3, 9, ['2981', '1883', 'M', '9641', 'x', '9813', 'j', '6023', '1181', 'j', 'l', '8345', '2067', '9819', '8027', '2747', '9415', 'R', '5699', '9787', '3617', 'E', '2287', 'u', 'h', '2101', 'W', 'z', '1043']

A:
26658
****