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]: 11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']
[A]: 60282


[Q]: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']
[A]: 38666


[Q]: 2, 9, ['w', '1145', '7745', 'r', '6715', 'p', 'o', 'G', '7061', 'i', 't', 'b', '741', 'Y', 'f', 'Z', '9619', 'e', '9425', 'M', '775', 'j']
[A]:
22666