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: 22, 23, ['H', '5147', '9429', 'v', '7687', 'r', '847', '1305', '483', '5113', '3175', 'N', '6195', 'A', '9111', '7507', '9639', 'W', '6673', 'T', '7525', 'g', 'O', '8593', 'g', '5257']

Output: 0


Input: Consider Input: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']

Output: 9892


Input: Consider Input: 6, 13, ['5175', 'x', '9921', '5505', '7571', 'V', 'f', 'p', '7749', '4875', 'j', 'l', '7569', '9017', '57', 'd', 'j', '5653', 'Z', '8663', '3635', 'd', '3873', 'J', 'Z', '9125', '3335', 'x', 'a']


Output: 20193