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, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
Example Output: 6328

Example Input: 12, 23, ['A', 'i', '4191', 'B', '2297', '3959', '1125', 'c', '739', '7887', 'p', '8173', '5301', '1969', '9737', '7011', '9845', 'r', '2977', 'z', 'Q', 'N', '3847', 's', 'D', '3391', 'T']
Example Output: 48860

Example Input: 9, 11, ['3155', '9605', '3639', '7739', 'n', '8997', '9597', 'i', '2223', 't', 'L', '9923', '1749', 'h', 'v', 'x', 'a', 'M', '2693', 'q', '9419', 'H', '2507', 'm', 'O']
Example Output:
2223