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.

Example Input: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']
Example Output: 7720

Example Input: 3, 14, ['Y', '9099', 'H', 'D', 'M', '1111', 'N', '4939', 'b', 'Y', '13', 'L', 'J', '4045', '2005', 'F', 'O', '1495', 'J', 'h', 'G']
Example Output: 10108

Example Input: 2, 3, ['q', '4221', '9583', 'o', 'I', 'c', 'B', 'd', 'O', '1497', '4821', '1331', 'X', '7131', '6409', 'A', '4119', 'j', '8959', 'j', 'K', 'V', '8575', 'n', 'W', '3995', 'Y']
Example Output:
13804