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: 1, 2, ['5605', '6415']

Output: 12020


Input: Consider Input: 1, 14, ['9503', '5983', '143', 'j', '9227', 'g', 'X', '5995', '6623', 'k', 'q', '1047', '2815', '569', 's', 'D', '4045', 'G', '9707', '6707', '7953', 'R']

Output: 41905


Input: Consider Input: 10, 26, ['9237', '4805', '5805', '1333', '6275', '4205', 'd', 'J', 'n', '77', '7609', 'y', '7953', '8379', '9761', 'Y', 'k', '4771', 'A', '3249', '8007', '2393', '8233', 'H', 'M', '1385', 'M']


Output: 61817