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: 1, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']

Output: 23384


Input: Consider Input: 1, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']

Output: 26373


Input: Consider Input: 3, 16, ['y', 'c', 'E', '7221', 'm', 'M', '179', '2201', 'k', '129', '561', '6161', 'X', '675', '9979', 'T', '511', '835', 'C', 'D', 'z', 'b', '2445', 'm', 'F', 'W', 'n']


Output: 27106