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]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[EX A]: 14032

[EX Q]: 16, 17, ['v', 'r', 'A', '6899', '8985', '1859', '1257', '6781', 'l', '8553', '5911', 't', '9965', 'G', '1011', '6081', '8727']
[EX A]:
14808