n = int(input())
d = list(input().split())
d = [int(i) for i in d]
a,b = input().split()
a = int(a)
b = int(b)
ans = 0
for i in range(a-1,b-1):
ans += d[i]
print(ans)#include<bits/stdc++.h>
#define makeitfastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL));
#define modulo 10e9+7
#define nl '\n'
#define cy cout<<"YES"<<nl
#define cn cout<<"NO"<<nl
typedef long long int ll;
using namespace std;
int main()
{
makeitfastread();
ll test=1;
cin>> test;
ll arr[test+1];
for(ll tt=1; tt<test; tt++)
{
cin>>arr[tt];
}
ll a,b,sum=0;
cin>>a>>b;
for(ll i=a;i<b;i++)
{
sum+=arr[i];
}
cout<<sum<<nl;
}
1424M - Ancient Language | 600C - Make Palindrome |
1669D - Colorful Stamp | 1669B - Triple |
1669A - Division | 1669H - Maximal AND |
1669E - 2-Letter Strings | 483A - Counterexample |
3C - Tic-tac-toe | 1669F - Eating Candies |
1323B - Count Subrectangles | 991C - Candies |
1463A - Dungeon | 1671D - Insert a Progression |
1671A - String Building | 1671B - Consecutive Points Segment |
1671C - Dolce Vita | 1669G - Fall Down |
4D - Mysterious Present | 1316B - String Modification |
1204A - BowWow and the Timetable | 508B - Anton and currency you all know |
1672A - Log Chopping | 300A - Array |
48D - Permutations | 677C - Vanya and Label |
1583B - Omkar and Heavenly Tree | 1703C - Cypher |
1511C - Yet Another Card Deck | 1698A - XOR Mixup |