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, 6, ['4301', 'a', 'E', '3709', '5105', 'B']
[EX A]: 8814

[EX Q]: 17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']
[EX A]: 14824

[EX Q]: 2, 11, ['N', '9151', 'q', 'i', 'x', '7837', 'F', 'U', '5039', 'V', 'g', 'Y', '2645', '1587', '5983', '3373', '6771', 'h', '99', 'h']
[EX A]:
22027