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, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']
[A]: 24740


[Q]: 5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']
[A]: 12062


[Q]: 3, 4, ['2079', '7945', 'L', '6079', 's', 'c', 'f']
[A]:
6079