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, ['5057', 'Z', 'a', '4561', '225', '6921', 'T', '4033', '1259', '9805', 'l', '5641']

Ex Output:
9843


Ex Input:
1, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']

Ex Output:
30927


Ex Input:
16, 27, ['U', '4123', '1061', '5811', 'r', '5415', 'h', 'U', 'q', '9645', 'D', '4957', '907', 'p', '2139', 'U', '7267', 'p', '661', 'J', '6619', 'h', 'A', 'A', '2315', '3321', 'I']

Ex Output:

20183