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.

Ex Input:
9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']

Ex Output:
0


Ex Input:
9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

Ex Output:
4364


Ex Input:
21, 24, ['3401', '3861', '8345', 'Y', '6905', '9905', '1407', '6513', 'O', 'P', '3877', '3605', '4843', '6741', '2759', '9515', 'z', '5555', '7927', '2207', 'b', '3805', '307', '6891', 'm', 'u', '1713', '8089']

Ex Output:

11003