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, 2, ['4965', '6219']
Example Output: 6219

Example Input: 3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
Example Output: 20895

Example Input: 22, 23, ['7629', 'e', 'U', 'k', 'N', 'N', 'H', 'l', '8333', '4409', 'G', '6377', '5569', 'O', 'U', '2555', '2201', '6529', '9519', '639', '9973', 'e', '33', 'P', 'V', 'o', 'x']
Example Output:
33