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]: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
[A]: 283


[Q]: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
[A]: 12942


[Q]: 5, 11, ['k', 'l', 'S', '8355', '5561', '4131', '9599', '4123', '9947', 's', 'd', '2445', 'i', '4829', 'm', '2533', 'N']
[A]:
33361