1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// Karol Kosinski 2024
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 35;

LL D[NX];
int n;

LL rec(LL h, LL w, int k)
{
    if ( h == 0 or w == 0 ) return 0;
    LL d = D[k];
    LL hdiv = h / d, hmod = h % d;
    LL wdiv = w / d, wmod = w % d;
    LL sum = hdiv * wdiv;
    sum += rec( hmod, wmod, k - 1 );
    sum += rec( h - hmod, wmod, k - 1 );
    sum += rec( hmod, w - wmod, k - 1 );
    return sum;
}

LL testcase()
{
    LL h, w;
    cin >> h >> w >> n;
    FOR(i,0,n) cin >> D[i];
    if ( h % D[0] != 0 or w % D[0] != 0) return -1;
    return rec( h, w, n - 1 );
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << testcase() << endl;
    return 0;
}