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]: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']
[EX A]: 38111

[EX Q]: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
[EX A]: 19497

[EX Q]: 1, 22, ['5937', '775', 'F', 'r', '9677', '8971', 'Q', 'n', '8139', '499', '9357', '1511', 'T', 'W', 'l', 'E', '8089', '1375', 'J', '3921', '2731', 'd', '1499', '6873']
[EX A]:
60982