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

Output: 26162


Input: Consider Input: 1, 2, ['j', '3613']

Output: 3613


Input: Consider Input: 3, 5, ['529', 'F', '6389', '913', 'x', '7907', '2517', '971', 'g', '3939', 'u', 'R', 'd', 't', '9445', '2149']


Output: 7302