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, 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: 2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
Example Output: 34470

Example Input: 4, 24, ['W', '3419', 'n', '6165', '9353', '2997', 'X', 'u', 'D', '8187', 'z', '595', 'p', '4887', 'E', '1983', 'b', '9971', 'a', 'C', 'k', 'E', '6339', '5375', '2959']
Example Output:
55852