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]: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']
[EX A]: 1339

[EX Q]: 1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']
[EX A]: 13884

[EX Q]: 22, 29, ['w', '7129', '5957', '1295', '3663', 'n', 'C', 'F', '5443', 'H', '6375', '2887', 'k', 'e', 'o', 'o', '7823', 't', '8339', 'r', '7853', '3071', 'Y', 'H', 'L', '6143', 'C', 'F', 'e', 'K']
[EX A]:
9214