#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define pb push_back
#define ss second
#define ff first 
#define ub upper_bound
#define lb lower_bound
const ll M=1000000007;
#define inf 1000000000000000000
#define infn -1000000000000000000
ll ncr(int n,int r){if(r>n)return 0;if(r > n - r) r = n - r;ll ans = 1;
int i;for(i = 1; i <= r; i++){ans *= n - r + i;ans /= i;}return ans;}
ll power(ll x,ll n,ll m){if(n==0)return 1;else if(n%2==0)return (power(((x%m)*(x%m))%m,n/2,m))%m;else return ((x%m)*(power(x,n-1,m)%m))%m;}
int dx[] = {1,-1,0,0}; 
int dy[] = {0,0,1,-1};
ll modInverse(ll a,ll m){ll m0=m;ll y=0,x=1;if(m==1)return 0;while(a>1){ 
ll q=a/m;ll t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=m0;return x;} 
// std::rotate(vec.begin(), vec.begin()+rotL, vec.end());//rotl=no of left ro
// td::rotate(vec.begin(), vec.begin()+vec.size()-rotR, vec.end());
//str.substr(1,3); // takes(0 based indexing all from [1,3])
//transform(str.begin(),str.end(),str.begin(),::tolower);//also "toupper"
// to_string(ll),stoll(string)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
ll n,m,q,l,r,w,v;
cin>>n>>m>>q;
vector<pair<ll,ll>>vec,pec;
for(int i=1; i<=n; i++){
cin>>w>>v;
vec.pb({w,v});
}
pec=vec;
ll num[m],vis[n]={0};
for(int i=0; i<m; i++){
cin>>num[i];
}
while(q--){
cin>>l>>r;
l-=1,r-=1;
for(int i=0; i<n; i++)
vis[i]=0;
vector<ll>vec;
for(int i=0; i<m; i++){
if(l>i||i>r){
vec.pb(num[i]);
}
}
sort(vec.begin(),vec.end());
ll ans=0;
for(int i=0; i<vec.size(); i++){
ll d=infn,ind=-1,w=-1;
for(int j=0; j<pec.size(); j++){
if(vis[j]==0&&pec[j].ff<=vec[i]&&pec[j].ss>d){
d=pec[j].ss;
ind=j;
w=pec[j].ff;
}
if(vis[j]==0&&pec[j].ff<=vec[i]&&pec[j].ss==d){
if(w<pec[j].ff){
d=pec[j].ss;
ind=j;
w=pec[j].ff;
}
}
}
if(ind!=-1)
vis[ind]=1,ans+=d;
}
cout<<ans<<"\n";
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var) SORT(var); REVERSE(var)
#define OPTIMIZE_STDIO ios::sync_with_stdio(false); cin.tie(0); cout.precision(10); cout << fixed
#define endl '\n'

const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;

void solve(istream& cin, ostream& cout) {
  int t;
  cin >> t;
  REP(i, t) {
    ll n;
    cin >> n;
    string ans;
    if (n % 4 == 0) {
      ans = "Even";
    } else if (n % 2 == 0) {
      ans = "Same";
    } else {
      ans = "Odd";
    }
    cout << ans << endl;
  }
}

#ifndef TEST
int main() {
  OPTIMIZE_STDIO;
  solve(cin, cout);
  return 0;
}
#endif
