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: 1, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']
Example Output: 16204

Example Input: 3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']
Example Output: 62091

Example Input: 5, 16, ['3039', '2461', '3447', '1051', '2473', 'd', 'V', 'g', '4001', 'i', 'C', '9823', 'o', '1815', '7795', 'Y', '5269', 'i', 'k', '1643', 'b', 'I', '9161', '7673', '7635', 'V', '8741', 'q']
Example Output:
25907