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]: 7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']
[A]: 41208


[Q]: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
[A]: 47509


[Q]: 9, 18, ['8385', 'j', 'w', '211', '6725', 'b', 'z', '4097', '2983', 'E', 'I', '3301', 'G', 'j', 'j', 'K', '7875', 'I', '3049', '9849', '3709', '5249']
[A]:
14159