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: 14, 18, ['4235', 'd', '7915', '2595', '1123', '475', '7987', '287', '4659', '45', '737', 'l', 'Z', '5245', '8021', 'g', 'D', '9801', '2327', '339']

Output: 23067


Input: Consider Input: 8, 30, ['5585', '6253', '4067', '2991', '1809', 'y', '8803', 'e', 'T', '695', 'b', '8257', '6427', 'm', '2647', '2207', '3241', '3379', 'L', 'B', 'X', 'R', 'v', 'P', '3989', 'n', 'U', '6143', 'N', 'Y']

Output: 36985


Input: Consider Input: 9, 21, ['z', 'N', '549', 'G', 'N', '6403', 'z', '8629', '9335', '7107', '1953', '5997', 'P', 's', 'K', 'P', 'q', '1635', 'k', '3743', 'U', '1791', 'X']


Output: 29770