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:
4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Ex Output:
25920


Ex Input:
8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Ex Output:
3932


Ex Input:
9, 20, ['9423', 'B', '3435', '5337', '229', '2915', '2001', '3557', 'f', '7809', '3861', 'j', '3983', '3199', '5131', 'G', 'x', 'x', '1009', 'i', 'S', '6967', '2327', 'e', '2699', '1703', '71', '625']

Ex Output:

24992