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, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
[EX A]: 22725

[EX Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[EX A]: 24200

[EX Q]: 1, 2, ['2109', 'u']
[EX A]:
2109