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.

[EX Q]: 5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
[EX A]: 19814

[EX Q]: 4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
[EX A]: 28723

[EX Q]: 9, 14, ['2761', 'S', '4237', 'r', 'n', 'Y', 'm', 'N', 'O', 'N', 'Y', '4775', '4407', 'C', '7257', 'g', 'H', 'M']
[EX A]:
9182