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, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Output: 45165


Input: Consider Input: 9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']

Output: 14713


Input: Consider Input: 21, 22, ['J', '5465', 'O', 'S', '7771', 'H', '2503', '7467', 'N', 'Y', 'x', '4893', '1625', 'M', 'W', '3073', 'n', '4623', '7851', '659', 'j', '6573']


Output: 6573