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]: 4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']
[A]: 12203


[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']
[A]: 42867


[Q]: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
[A]:
1538