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, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
[EX A]: 34470

[EX Q]: 1, 2, ['7321', '6233']
[EX A]: 13554

[EX Q]: 2, 3, ['K', 'r', '3479', '5449', 'H', 'Q', '6251', '6489', 'c', 'J']
[EX A]:
3479