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]: 13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
[A]: 22900


[Q]: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']
[A]: 10235


[Q]: 15, 26, ['7593', 'x', '7543', '7', '4175', 'e', 'U', '949', '4369', 'j', 'm', 'w', 'C', '1585', 'Y', '9203', 'M', 'i', 'D', '5545', '6223', 'o', 'U', 'j', 'j', '8495', 'z', '9495', 'L']
[A]:
29466