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]: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
[EX A]: 5121

[EX Q]: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
[EX A]: 0

[EX Q]: 12, 21, ['C', 'f', 'F', 'k', '9891', 'p', '8751', 'a', '2261', '7277', 'E', '345', 'Y', 'W', 'J', '295', '3569', 'm', 'b', 'i', 'H', '8567', '4827', 'f', 'O', 'a', '2797', 'H']
[EX A]:
4209