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: 3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']

Output: 0


Input: Consider Input: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']

Output: 28268


Input: Consider Input: 1, 8, ['2161', 'b', '3251', 'A', '8649', 'n', 'D', 'F', '1353', 's', '139', 'b', 'a', 'e', 'P']


Output: 14061