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]: 1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
[A]: 2957


[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]: 4, 10, ['9779', 'n', '5695', 'y', 'P', 'm', 'T', '1541', '8097', 'R', 'F']
[A]:
9638