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, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']
[EX A]: 25653

[EX Q]: 5, 16, ['t', 'r', 'O', 'q', 'B', '6327', 'f', 'R', 'H', '4429', 'o', '5347', 'U', 'h', '7067', '237', 'i', 'k', 'K', '461', 'L', '4105', 'i', '6483']
[EX A]: 23407

[EX Q]: 2, 4, ['i', '9889', '7135', 'W', 'c', '9279', '4393']
[EX A]:
17024