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.

2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']
27506

1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']
23479

7, 20, ['2661', 'm', 'K', '7357', '6739', 'F', '3497', '4401', '3233', 'f', 'S', 'v', '1385', '8503', '815', 'R', 'o', '7065', '1811', 'r', '9449', '7839', '8743', 'u', '4859', 'R', '2499', 'z']

30710