J. Jeronimo's List.cpp

#include <bits/stdc++.h>
using namespace std;

//Macros
#define PI 3.14159265359
#define all(v) v.begin(),v.end()
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(),v.rend())
#define sortaa(a,n) sort(a,a+n)
#define sortad(a,n) sort(a,a+n),reverse(a,a+n)
#define sfi1(v) scanf("%d",&v)
#define sfi2(v1,v2) scanf("%d %d",&v1,&v2)
#define sfi3(v1,v2,v3) scanf("%d %d %d",&v1,&v2,&v3)
#define sfll1(v) scanf("%I64d",&v);
#define sfll2(v1,v2) scanf("%I64d %I64d",&v1,&v2)
#define sfll3(v1,v2,v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
#define sfstr(v) scanf("%s", v);
#define sz(v) (int)v.size()
#define ndl puts("")
#define SS stringstream
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define loop(i,a,b) for (int i = a; i < (b); i++)
#define prec setprecision(n)
#define endl '\n'

//Short code
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pi;
typedef unsigned long long ull;
typedef long double ld;


int main() {
	 #ifndef ONLINE_JUDGE
	  	freopen ("input.txt","r",stdin);
	  	//freopen ("output.txt","w",stdout);
	  #endif
	  
	  int n, m, q;
	  cin>>n >>m >>q;
	  vi arr(m+1);
	  for(int i=1; i<=m ; i++) cin>>arr[i];
	  
	  for(int i=m+1,j=0; j<n-m && i<=n; j++, i++){
	  	 arr.pb((arr[i-m]+arr[i-m+1])%30000000);
	  }
	  //for(int i: arr) cout<<i<<endl;
	  sortva(arr);
	  while(q--){
	  	cin>>n;
	  	cout<<arr[n]<<endl;
	  }
  
   return 0;
}