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]: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']
[A]: 3201


[Q]: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
[A]: 4477


[Q]: 1, 5, ['N', 'r', 'Q', '4347', 'A', '2281', 'W', 'B', '999', '5851', 'w', '3615', '2971', '5047', '6929', '6165', '279', 'l', '7405', '5935', '9989', 'p', 'v']
[A]:
4347