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, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[A]: 6933


[Q]: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']
[A]: 7720


[Q]: 12, 15, ['7211', 'V', 'Z', 'y', '3999', '6117', 'r', '8043', 'p', 'I', '2331', '9799', '3191', '8527', '5997', '5461', '9665', '4829']
[A]:
27514