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]: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[EX A]: 6933

[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]: 10, 14, ['9789', 'L', '2981', '4651', '9773', '5823', '4851', 'R', 'w', 'T', 'U', 'E', '7587', 's', 'm', '9775', 'z']
[EX A]:
7587