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, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
Example Output: 26162

Example Input: 13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
Example Output: 22900

Example Input: 2, 6, ['c', '6057', 'k', 'G', 'Y', 'a']
Example Output:
6057