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, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']
[A]: 10176


[Q]: 2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
[A]: 34470


[Q]: 3, 24, ['3043', 'i', 'o', 'B', '1893', 'I', '9075', 'D', '9875', '2381', 'x', 'v', '4603', 'Q', 'E', 'C', '6315', '1555', '9131', '6847', 'x', '1137', 'i', 'O']
[A]:
52812