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: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Output: 10176


Input: Consider Input: 3, 5, ['w', 'T', '4091', 'g', 'i', 'y', 'Q', '5159', '6381']


Output: 4091