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, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
[EX A]: 33375

[EX Q]: 1, 16, ['h', '3509', '2585', 'L', '9433', '261', '6869', '105', '433', '8067', 'W', '53', 'y', '6809', 'W', 'H', 'J', '4211', '8037', '6745', '405', '1875', '9351', 'u', 'r', '6429', '5665', 'R']
[EX A]:
38124