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: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']
Example Output: 8604

Example Input: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
Example Output: 16811

Example Input: 3, 4, ['G', '6815', 'X', 'p', '4001', '6077', 'I', '1057', '9067']
Example Output:
0