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.

[EX Q]: 2, 3, ['f', 'C', 'f', 'V', 't', 'x']
[EX A]: 0

[EX Q]: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']
[EX A]: 18114

[EX Q]: 2, 3, ['8077', 'T', '3953', 'k']
[EX A]:
3953