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: 11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']

Output: 16421


Input: Consider Input: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']

Output: 4452


Input: Consider Input: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']


Output: 0