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, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']
[EX A]: 9829

[EX Q]: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']
[EX A]: 7371

[EX Q]: 2, 3, ['Q', 'k', 'm', 'z', '1949', '7853', 'r', '7417', 'I', '9671', 'z', 'K']
[EX A]:
0