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: 11, 16, ['3847', '4705', '7023', '7353', '9569', '7437', 'G', '7437', 'O', '8789', 'k', 'r', '8083', '7213', '4027', '595', 'P', 'n', '1377', '3271', '6443', '3251', 'K', 'K']
Example Output: 19918

Example Input: 3, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']
Example Output: 37505

Example Input: 13, 23, ['q', '4485', '2803', '9115', 't', 't', '9667', '3081', 'U', '7575', 'K', '6877', '3671', 'G', '4765', 'o', 'w', '7867', 'M', 'q', 'Q', '1863', 'd', '8013', '2767', '4813', 'e', '8305']
Example Output:
18166