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, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Output: 7896


Input: Consider Input: 3, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']

Output: 60835


Input: Consider Input: 10, 12, ['V', '7007', 'Z', 'U', 'X', 'C', 'N', '6009', '4193', '7885', '7123', 'V', '3833', 'B', '2101', '6269', '6559', 'c', '6701', 'f', '4659', '6145', 'y', 'w', '4345', '1243', '7033', '2163', 'K', '4999']


Output: 15008