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.

2, 3, ['E', '7611', '2621', '3237']
10232

5, 11, ['5641', 'c', 'z', '5969', 'w', '9149', 'r', 'B', 'y', '3315', 'M', '8087', 'j', '1159', '9365', 'b', 'a', 'y', '6957', '5735', '9739', '133', 'm', '4887']
12464

23, 26, ['o', 'U', '3003', '6499', 'r', '8541', 'Q', 't', 'x', '8307', 'N', 'M', '7405', 'Y', '4529', 'T', 'd', '3907', 'z', 'U', '8273', 'q', 'Z', '3741', 'Z', 'h']

3741