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 Input:
9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']

Ex Output:
14713


Ex Input:
6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']

Ex Output:
49687


Ex Input:
19, 20, ['4095', '1157', '9083', 'N', '4211', 'n', '919', '6415', 'w', '7519', '4593', 'H', 'P', 'r', '5735', '5907', 'L', '7775', '8377', '6807', '6969', '7403', '9021', '4815']

Ex Output:

15184