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]: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
[EX A]: 45165

[EX Q]: 6, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']
[EX A]: 0

[EX Q]: 2, 2, ['1319', 'j']
[EX A]:
0