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: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
Example Output: 203

Example Input: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']
Example Output: 18114

Example Input: 14, 27, ['8593', '357', '2749', 'z', 'h', 'e', 'f', '5507', 'j', '5929', '7749', 'y', '733', '1733', '1675', '7081', 'I', 'p', '1901', 'n', 'Y', 'I', '4557', '4853', 'F', '1913', '4607']
Example Output:
28320