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, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']

Output: 10235


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: 12, 16, ['7533', 'N', 'J', 'C', '615', 'E', 'Q', 'B', 'G', 'x', 'U', 'i', '2691', '7631', 's', '901', 'V', '6339', 'z', 'L', '293', 'T', 'u', 'a', '9975', 's', 'r', '9045', '1903']


Output: 11223