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: 4, 5, ['t', '9215', 'K', 'Q', 'w']

Output: 0


Input: Consider Input: 5, 7, ['t', 'e', 'P', 'H', 'I', 'U', 'a', '8147', 'i', 'D', 'x', 'x', 'i', 'm', '4893', '6443', '8841', 't', '4641', '9415', '1965', '673']

Output: 0


Input: Consider Input: 15, 18, ['V', '233', '7943', '9227', '5977', 's', 'Z', 'G', 'E', '7251', '3501', '1905', 'k', 'd', 'R', 'e', '6333', 'L', 'q', '8247']


Output: 6333