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: 1, 1, ['1449', '1257']
Example Output: 1449

Example Input: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']
Example Output: 1339

Example Input: 3, 19, ['5009', 'k', '2411', 'H', '5189', '7437', 'y', '1919', 'Q', '6997', '6649', '9053', '6711', '2569', 'T', 'r', 'e', '145', '6665', 'i', '2669', 'n', '1797', 'h', 't', '3949', 'e', '3461', 'S']
Example Output:
55745