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, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

Output: 0


Input: Consider Input: 5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Output: 4571


Input: Consider Input: 12, 13, ['W', 'q', '4865', '6029', 'T', 'r', 's', '5035', '2867', '5081', 'C', '3323', '1065', '3433', '2365', 'E', '7557']


Output: 4388