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.

Example Input: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
Example Output: 9466

Example Input: 25, 26, ['9367', 'G', 'c', '4997', 'g', 'r', '2893', 'T', '6693', 'I', '5127', 'N', '4333', '6905', '8539', 't', 'y', 'f', '8341', 'e', 'g', '8749', '3525', 'g', '6263', '321']
Example Output: 6584

Example Input: 1, 1, ['D', '8361', '2399', 'l', 'X', '9665', '1461', 'w']
Example Output:
0