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]: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']
[EX A]: 4364

[EX Q]: 4, 12, ['2337', 'A', 'j', 'p', 'c', 'k', 'Y', 'Q', 'N', 'L', '8857', '9985', 'N', 'x', 'u']
[EX A]: 18842

[EX Q]: 9, 16, ['8603', 'N', 'W', '981', '8309', '9235', 'b', 'X', 'y', 's', 'C', 'N', 'Q', 'M', '4473', 'v', 'D', 'U', '6367', '5851', '7713', '6059', 'Q', '3287', '1921', '6763', '3853']
[EX A]:
4473