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: 2, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']
Example Output: 53691

Example Input: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
Example Output: 14716

Example Input: 9, 19, ['6531', '965', 'l', 'K', 'K', 'i', 'F', 'q', 'H', 'g', '5333', 'R', 'k', '875', 't', '665', '5817', '3939', 'R', 'w', 'P', '9639', 'e', 'u', 'P']
Example Output:
16629