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.

[EX Q]: 1, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']
[EX A]: 46930

[EX Q]: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
[EX A]: 9392

[EX Q]: 1, 3, ['6581', '2427', 'f', '5291']
[EX A]:
9008