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, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Output: 18160


Input: Consider Input: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']

Output: 0


Input: Consider Input: 8, 11, ['967', 'P', '7941', 'y', '4095', 'P', 'j', 'c', '1869', '4083', 'v', '5071', '1639', '555', 'r', 'x', '7001', '6503', 'B', '707', '6739']


Output: 5952