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:
20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']

Ex Output:
16811


Ex Input:
5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']

Ex Output:

4383