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: 2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']
Example Output: 47279

Example Input: 1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']
Example Output: 0

Example Input: 9, 11, ['9231', '2989', '675', '403', 'V', 'r', '2913', 'l', '1975', 'A', '6861', '4025', '8993', 'h', '4983', '1585', '6135', '6617', '3097', 'R', '5279', '8121', '9975', 'r', '2607', 'U', 'T', '2157', 'Z']
Example Output:
8836