#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long LL;
const int N = 1e6 + 10;
LL a[N];
int main()
{
cin >> a[0] >> a[1];
int len;
cin >> len;
for(int i = 2;i <= len;i ++)
a[i] = a[i/2] + a[i/4];
int t;
cin >> t;
while(t --)
{
LL x;cin >> x;
int pos = lower_bound(a,a+len,x)-a;
if(a[pos]==x) cout << pos << endl;
else cout << "-1" << endl;
}
return 0;
}