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]: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']
[EX A]: 51416

[EX Q]: 14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
[EX A]: 19532

[EX Q]: 2, 14, ['O', '2767', 'R', '5975', 'Y', '3849', '6029', 'E', '7753', 'B', '1315', 'e', 'X', 'Z', '5807', '3883', '1351', '3395', 'e', 'e', '9045', 'O']
[EX A]:
27688