//shjj-bzoj1021
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
class queue{public:int use,A,B;} q[8000000+3];
int f[6+3][1000+3][1000+3],a[3+3][6+3],s[3+3],smoney[6+3],g[6+3],G[6+3];
bool vis[6+3][1000+3][1000+3];
int x1,x2,x3;char ch;
void read(int &ss){bool zf=false;for (;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());if (ch=='-'){zf=true;ch=getchar();}ss=0;for (;ch>='0'&&ch<='9';ss=ss*10+ch-'0',ch=getchar());if (zf) ss=-ss;}
int gcd(int a,int b){if (!a) return b;return gcd(b%a,a);}
int main()
{
read(x1);read(x2);read(x3);
g[6]=100;g[5]=50;g[4]=20;g[3]=10;g[2]=5;g[1]=1;
for (int i=1;i<=3;i++)
for (int j=6;j>=1;j--) {read(a[i][j]);s[i]+=a[i][j]*g[j];smoney[j]+=a[i][j];}
G[6]=g[6];int Sum=s[1]+s[2]+s[3];
for (int i=5;i>=1;i--) G[i]=gcd(g[i],G[i+1]);
int Ta=s[1]-x1+x3,Tb=s[2]+x1-x2,Tc=s[3]+x2-x3;
memset(f,120,sizeof(f));
q[1].use=1,q[1].A=s[1],q[1].B=s[2];f[1][s[1]][s[2]]=0;
for (int l=0,r=1;l<r;)
{
int ux=q[++l].use,sa=q[l].A,sb=q[l].B,sc=Sum-sa-sb;
vis[ux][sa][sb]=false;
for (int i=0;i<=smoney[ux];i++)
for (int j=0;j+i<=smoney[ux];j++)
{
int tsa=sa-a[1][ux]*g[ux],tsb=sb-a[2][ux]*g[ux],tsc=sc-a[3][ux]*g[ux];
tsa+=i*g[ux],tsb+=j*g[ux],tsc+=(smoney[ux]-i-j)*g[ux];
int ff=abs(i-a[1][ux])+abs(j-a[2][ux])+abs(smoney[ux]-i-j-a[3][ux]);
ff/=2;
if (ux<6&&abs(tsa-Ta)%G[ux+1]) continue;
if (ux<6&&abs(tsb-Tb)%G[ux+1]) continue;
if (ux<6&&abs(tsc-Tc)%G[ux+1]) continue;
if (f[ux][sa][sb]+ff<f[ux+1][tsa][tsb])
{
f[ux+1][tsa][tsb]=f[ux][sa][sb]+ff;
if (vis[ux+1][tsa][tsb]) continue;
q[++r].use=ux+1,q[r].A=tsa,q[r].B=tsb;
vis[ux+1][tsa][tsb]=true;
}
}
}
if (f[7][Ta][Tb]<2e9) printf("%d",f[7][Ta][Tb]);
else printf("impossible");
}