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, 5, ['5713', 'f', 'g', '9979', '2651', 't', '6513', 'v', '5733', '3325', 'M', 'B', '6139', 'n', 'K', 'h', 'c', '1181', '1263', '6625', 'F', '7059', 'c', '4083', 'i', 'g', '6783']
Example Output: 12630

Example Input: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']
Example Output: 24001

Example Input: 4, 10, ['487', 'K', '1783', 'H', '1421', '5491', '4971', 'e', '3493', 'Q', '8255', 'r', 'r']
Example Output:
15376