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]: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']
[A]: 655


[Q]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[A]: 9035


[Q]: 6, 18, ['9473', 'Y', 'G', 'R', 'G', '5137', 'Q', 'z', 'a', '3721', 'F', '7139', 'K', '8561', '1397', '2113', '6791', '8811', 'g', '3683']
[A]:
43670