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.

[Q]: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
[A]: 3932


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


[Q]: 9, 11, ['C', 'f', '1915', 'u', 't', '3557', 'T', 'Y', 's', 'Q', '7973', 'G', '7131', '8159', '7079', 'b', '7465', '4795', 'X', '5295', 'c', 'u']
[A]:
7973