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]: 1, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']
[A]: 57104


[Q]: 2, 2, ['R', '979', 'H', 'W', 'y']
[A]: 979


[Q]: 1, 13, ['7359', '4375', '5141', 'C', '8057', '6687', 's', '5801', 'o', '9261', '2129', '601', 'E', '2785']
[A]:
49411