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, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']
[EX A]: 0

[EX Q]: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
[EX A]: 26162

[EX Q]: 5, 5, ['A', 'U', '5071', 'p', 'Y', 'K', 'R', '9431', '8331', 'R', 'T', '545']
[EX A]:
0