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]: 15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']
[EX A]: 34357

[EX Q]: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']
[EX A]: 16002

[EX Q]: 10, 23, ['o', 'B', '319', '1443', 'U', 'R', 'r', 'n', 'v', 'x', '8363', '8951', '2479', 'o', 'S', '4503', 'T', '8581', '493', 'J', 'o', 'C', 'H']
[EX A]:
33370