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: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']

Output: 18114


Input: Consider Input: 2, 2, ['4965', '6219']

Output: 6219


Input: Consider Input: 11, 11, ['3499', 'W', '1539', '5427', 'z', 'J', 'm', '3085', '5115', 'W', '7421']


Output: 7421