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.

Input: Consider Input: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']

Output: 40773

Input: Consider Input: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']

Output: 14437

Input: Consider Input: 12, 26, ['B', 'r', 'O', '3195', '3381', '1751', '6271', '7747', 'P', 'Q', '4533', '7307', '5933', 'Q', 'w', 'g', '4481', '3691', 'e', '3351', 'f', '9839', '7243', '6575', '8577', '7811', 's', 's']
Output: 64808