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, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']
[A]: 8063


[Q]: 2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']
[A]: 42598


[Q]: 4, 5, ['a', 'Q', '1717', '4923', 'W', 'f', '3679']
[A]:
4923