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]: 3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']
[EX A]: 719

[EX Q]: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']
[EX A]: 18114

[EX Q]: 15, 20, ['9541', 'u', '3953', '4683', 'W', 'N', '4147', '7681', 'A', 'h', '2233', 'j', '949', '3125', '7085', 'x', 'S', '7911', '8629', '4101', '3069', '3741', '9765', 'm', '7689', '9209', 'b', '8267']
[EX A]:
27726