#include<iostream>
#include<cstdio>
#include<map>
#include<queue>
#define N 12
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int d[N+1];
	bool operator < (const reads &t)const
	{
		for (int i=1;i<=12;++i)
			if (d[i]!=t.d[i])
				return d[i]<t.d[i];
		return 0;
	}
};
reads zero;
map<reads,int>dp;
int n,cnt[N+1],ans;
int F(reads x)
{
	int res=0;
	for (int i=1;i<=12;++i) res+=x.d[i]*i;
	return res/10;
}
int main()
{
	reads top,st;
	queue<reads>q;
	int x;
	n=read();
	for (int i=1;i<=n;++i) x=read(),cnt[x]++;
	q.push(zero),dp[zero]=1;
	while (!q.empty())
	{
		top=q.front(),q.pop();
		for (int i=1;i<=12;++i)
			if (top.d[i]+1<=cnt[i])
			{
				st=top,st.d[i]++;
				if (dp.find(st)==dp.end()) dp[st]=dp[top]+(F(st)!=F(top)),q.push(st);
				else dp[st]=max(dp[st],dp[top]+(F(st)!=F(top)));
			}
	}
	for (auto it:dp) ans+=it.second;
	printf("%d\n",ans);
	return 0;
}