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]: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
[EX A]: 0

[EX Q]: 3, 4, ['v', 't', '4357', '1303']
[EX A]: 5660

[EX Q]: 1, 3, ['7945', 'W', '7105', '3641', 'b', 'o', 'x', 'O', 'e', 'n', '2965', 'K', 'B', '8421', '7705', '2803']
[EX A]:
15050