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.

Input: Consider Input: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

Output: 10497


Input: Consider Input: 8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']

Output: 34373


Input: Consider Input: 12, 22, ['D', '8637', 't', 'f', 'A', '3417', 'L', 'G', '5073', 'O', '6221', 'N', 'r', '4987', 'f', 'z', 'v', 'v', 'U', '1859', 'h', '9841', '2665', '1377', 'K']


Output: 16687