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.

Input: Consider Input: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']

Output: 5085


Input: Consider Input: 1, 5, ['5057', 'Z', 'a', '4561', '225', '6921', 'T', '4033', '1259', '9805', 'l', '5641']

Output: 9843


Input: Consider Input: 7, 15, ['6957', '8075', '6233', 'U', '4337', '2249', '5109', '6179', 'N', '7171', '1315', 'n', '5233', 'J', 'c', 'y', '5315', '8239', '5059']


Output: 25007