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: 10, 27, ['Y', 'Q', 'o', '9581', '2725', 'd', '8857', '1477', '2451', '8595', 'I', 'I', '4883', '3781', 'E', '9539', 'k', '1245', '6741', '2051', 'l', '5245', 'e', '6949', '4361', 'U', 'I', 'J', '7867', '991']
Example Output: 53390

Example Input: 6, 20, ['F', 'D', '3457', 'U', 'J', '2273', '3719', '3255', '689', 'y', '6123', '8973', '7559', '3483', 'B', 'M', '1529', 'e', 'g', 'P', '7185', '2019']
Example Output:
37603