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]: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']
[EX A]: 59416

[EX Q]: 5, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']
[EX A]: 40165

[EX Q]: 7, 8, ['A', '6731', 'W', '8661', 'd', 'l', '5735', '9575', '6693', '6407', 'G', '2863', '2141', 'u', '9441', '8655', 'w']
[EX A]:
15310