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]: 2, 12, ['8519', 'c', '7575', '1517', '2735', '4339', '7765', '6455', 'D', 'G', '2437', '9663', '3765', '299', 'n', '7921', 't', 'M', 'l', '515']
[A]: 42486


[Q]: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']
[A]: 51416


[Q]: 2, 26, ['5023', 'g', 'b', 'Y', '9543', 'v', 'l', 'A', '5757', '1275', 'v', 'p', 'W', 'w', '7805', '2253', 'j', 'O', '1419', '8881', '5169', '7257', 'J', '4969', '3549', '7599', 'O', '9989']
[A]:
65476