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.

[EX Q]: 3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']
[EX A]: 42867

[EX Q]: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']
[EX A]: 0

[EX Q]: 1, 11, ['b', 'Y', 'd', 'V', 'T', '1823', '9397', 'k', 'i', '1647', 'X', '1677', '8319', '1561', '849', 'Y', '2691', '7807', '4585', '8905']
[EX A]:
12867