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: 15, 24, ['987', '1799', 'q', '4969', '7401', 'M', '1637', '423', 'D', '2883', 'O', '5667', 'z', 'k', '6791', 'O', 'o', '4693', '6961', 'E', 'k', 'm', 'g', 'O', '7131', 'I', '7671']

Output: 18445


Input: Consider Input: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Output: 6189


Input: Consider Input: 4, 23, ['8423', '4857', 'S', '4497', 's', '2223', '3827', 'd', 'k', 'W', 'T', 'd', 'u', '553', 'i', '9755', '4991', 'E', '7737', 'P', '8017', 'q', 'c', 'D', '421', 'F']


Output: 41600