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, 10, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']
[A]: 36339


[Q]: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']
[A]: 5085


[Q]: 2, 5, ['7927', '2449', '6379', 'l', 'r', '4315', '2321', '685', '9423', '9427']
[A]:
8828