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:
3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']

Ex Output:
8337


Ex Input:
2, 6, ['5473', '3405', 'o', 'o', '2917', '6121', 'p', '3985', 'g', '9279', 'j', '8079', 'E', '9549', '549', '8419', '7261', '2073', '3985', '7033', '1385']

Ex Output:

12443