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]: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']
[EX A]: 49687

[EX Q]: 3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']
[EX A]: 55494

[EX Q]: 2, 9, ['g', '683', '6419', 'b', '7', 'L', 'f', '5905', '4641', '581', 'B', '4201', 'H', '2337', 'Z', 'V', 'H', '6803', 'e', 'Z', 'P', 'E', 'o', 'T', 'b', 'G']
[EX A]:
17655