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: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
Example Output: 10058

Example Input: 3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']
Example Output: 55494

Example Input: 2, 16, ['855', '7313', 'l', 'S', 'w', 'n', '8257', '1447', 's', 'Q', 'I', '1067', 'l', '2221', '5505', '1605', '3087', 'X']
Example Output:
27415