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]: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']
[EX A]: 11266

[EX Q]: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
[EX A]: 123

[EX Q]: 4, 9, ['5555', 'b', '849', 's', '3289', 'v', '6215', '635', '9949', '4087', '2669', 'M', 'C', '7325', '6749']
[EX A]:
20088