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: 6, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']

Output: 5738


Input: Consider Input: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']

Output: 123


Input: Consider Input: 9, 19, ['5359', '2471', '7013', '515', 'U', '3495', 'E', '4431', 'd', '4355', '1397', 'R', 's', '7819', '773', 'h', 'W', 'C', 'l', '3975', '1747', 'l', 'E', 'M', 'D', '9095', 'c', '3579']


Output: 14344