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: 1, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']

Output: 57831


Input: Consider Input: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']

Output: 19497


Input: Consider Input: 19, 20, ['5339', '2845', '6647', '3493', '6597', '5137', 'x', 'Z', '3567', '5175', 'H', '2177', 'g', '6751', 'C', '9305', 'Z', '689', 'x', 'l', '6621', 'x', '5243', '4441', 'W', '8401']


Output: 0