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, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']

Output: 4591


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: 21, 24, ['9095', 'f', '391', 'O', 'X', 'S', '3681', '8919', 'W', 'W', '381', 'v', '7541', '4037', 'U', 'h', '4057', '6383', '3603', '6633', '4847', '7251', '2023', '6651', '3775', '3187', '2881', '7253']


Output: 20772