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:
1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

Ex Output:
11266


Ex Input:
3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']

Ex Output:
9392


Ex Input:
5, 16, ['L', 'c', 'r', '6873', 'Z', '6769', 'h', 'd', '9493', '9779', '7947', '3019', '5005', '6115', 'M', 'j', '7515', '8845', '2581', '9995', '927', '2379', 'N', 's', '4029', '4673', 'E']

Ex Output:

48127