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: 5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Output: 0


Input: Consider Input: 5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']

Output: 4383


Input: Consider Input: 10, 14, ['8519', 'P', '5173', 'A', 'O', 'a', 'y', '1129', 'T', 'j', '229', 'm', '3669', '8611', '4409']


Output: 12509