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, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']
Example Output: 23479

Example Input: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
Example Output: 12702

Example Input: 7, 12, ['7633', '925', '6191', 'H', '1611', 'V', '7659', 'l', 'P', '1361', '415', '1929', 'b', 'O', 'y', '317', '3607', '311']
Example Output:
11364