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, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
[EX A]: 0

[EX Q]: 5, 22, ['t', '8483', '8799', 'W', 'l', '2567', '2787', 'L', 'G', 'T', '5765', '5029', '8059', '8505', '6905', 'Z', '8153', 'e', 'K', '3529', 'g', '2667', '6629', 'O']
[EX A]: 53966

[EX Q]: 9, 15, ['4185', '6823', 'k', 'N', 'H', 'w', 'B', 'A', 'g', '6953', 'M', 'h', 'k', 'E', '4867', '1135', 'p', 'j', 'c', '5451', 'Y', '3359']
[EX A]:
11820