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:
7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']

Ex Output:
8414


Ex Input:
1, 2, ['m', 'E']

Ex Output:
0


Ex Input:
6, 12, ['9403', '2709', 'B', '5871', 'b', '339', '981', '4469', 'Z', '4145', 'I', '8289', 'k', '2229']

Ex Output:

18223