Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		a, _ := strconv.Atoi(buf[0])
		b, _ := strconv.Atoi(buf[1])
		c, _ := strconv.Atoi(buf[2])
		d, _ := strconv.Atoi(buf[3])
		e, _ := strconv.Atoi(buf[4])
		f, _ := strconv.Atoi(buf[5])
		if a == 0 {
			break
		}
		fmt.Println(100-((5*a+3*b)*2)-(f-5*a-3*b-e)*3+15*a+15*b+15*(5*a+3*b)+c*7+d*2)
	}
}

C++: #include <iostream>

using namespace std;

int main()
{
  int b, r, g, c, s, t;

  while(1){
    cin >> b >> r >> g >> c >> s >> t;
    if(b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0){
      break;
    }
    t -= s;
    int tb = 5*b + 3*r;
    t -= tb;
    int u = tb*13;
    int m = t * 3;

    int v = 100 + u + 15*(b+r) + 7*g + 2*c - m;
    cout << v << endl;
  }

  return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
    int b,r,g,c,s,t;
    while(scanf("%d%d%d%d%d%d",&b,&r,&g,&c,&s,&t),b,r,g,c,s,t){
        int ans = 0;

        ans += b*65;
        ans += b*15;
        t -= b+b*5;
        ans -= b*3;
        ans += r*39;
        ans += r*15;
        t -= r+r*3;
        ans -= r*3;
        ans += g*7;
        t -= g;
        ans -= g*3;
        ans += c*2;
        t -= c;
        ans -= c*3;
        t -= s;
        ans -= t*3;

        ans += 100;
        printf("%d\n",ans);
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int b, r, g, c, s, t;
    while(1){
        cin >> b >> r >> g >> c >> s >> t;
        if(!b && !r && !g && !c && !s && !t) break;
        
        int ans;
        ans = 100 + b*15 + r*15 + g*7 + c*2 + b*5*15 + r*3*15 - (t-5*b-3*r-s)*3 - (5*b+3*r)*2;
        cout << ans << endl;
    }
    
}

C++: #include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back


int main() {
    int b,r,g,c,s,t;
    while(cin>>b>>r>>g>>c>>s>>t){
        if(b==0 && r==0 && g==0 && c==0 &&s==0 && t==0)break;
        int sum=100;

        sum-=3*( t-(s + b*5 + r*3) );
        sum-=2*( b*5 + r*3 );
        
        sum+=b*15 + r*15 + g*7 + c*2;
        sum+=b*5*15 + r*3*15;
        
        cout<<sum<<endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int big,regu,nob,ci,su,t;
    while(cin>>big>>regu>>nob>>ci>>su>>t,big,regu,nob,ci,su,t)
        cout<<100+ci*2+nob*7+regu*63+big*95-(t-su)*3<<endl;
}

C++: #include<bits/stdc++.h>

using namespace std;


int main() {
	int b, r, g, c, s, t;
	int get, cost, bonusCnt;

	while (true) {
		cin >> b >> r >> g >> c >> s >> t;
		if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0) {
			break;
		}

		bonusCnt = b * 5 + r * 3;
		get = 100 + (b + r + bonusCnt) * 15 + g * 7 + c * 2;
		cost = bonusCnt * 2 + (t - bonusCnt - s) * 3;
		cout << get - cost << endl;
	}

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std ;

main(){
	int b,r,g,c,s,t ;
	while( cin>>b>>r>>g>>c>>s>>t ){
		if( !b && !r && !g && !c && !s && !t ) break ;
		
		int sum = 100 ;
		sum += b*6*15 +  + r*4*15 + g*7 + c*2 ;
		t -= s ;
		sum -= t*3 - b*5 - r*3 ;
		
		cout << sum << endl ;
	}
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)

int b,r,g,c,s,t;

int main(){
	while(cin>>b>>r>>g>>c>>s>>t&&t){
		cout<<100+b*95+r*63+g*7+c*2+s*3-t*3<<endl;
	}
}

C++: #include<iostream>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>

#define rep(i,n) for(int i=0;i<n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define rp(i,c) rep(i,(c).size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double INF=1e12,EPS=1e-9;

int main()
{
	int b,r,g,c,s,t;
	while(cin>>b>>r>>g>>c>>s>>t,b+r+g+c+s+t){
		int ans=100-3*t+95*b+63*r+7*g+2*c+3*s;
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cassert>
#define _A_ true
using namespace std;


int main(){
  long long b,r,g,c,s,t;
  while(_A_){
    cin >> b >> r >> g >> c >> s >> t;
    if(b+r+g+c+s+t == 0)break;
    long long sem = 100;
    sem += 7*g;
    sem += 2*c;
    sem += 15*b*6;
    sem += 15*r*4;
    t -= (b*5+r*3+s);
    sem -= b*2*5;
    assert(sem>=0);
    sem-= r*2*3;
    assert(sem>=0);
    sem -= t*3;
    assert(sem>=0);
    cout << sem << endl;
  }
  return 0;
}

C++: #include<iostream>

using namespace std;

int main(void){
	int b,r,g,c,s,t,ans;
	while(1){
		cin >> b >> r >> g >> c >> s >> t;
		if(b==0 && r==0 && g==0 && c==0 && s==0 && t==0)break;
		ans=100;
		ans+=b*15*6;
		ans+=r*15*4;
		ans+=g*7;
		ans+=c*2;
		ans-=(t-s-b*5-r*3)*3;
		ans-=b*5*2+r*3*2;
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	int b,r,g,c,s,t;
	while(1){
		cin>>b>>r>>g>>c>>s>>t;
		if(b==0 && r==0 && g==0 && c==0 && s==0 && t==0) break;
		o(100+15*(b+r)+7*g+2*c+13*(5*b+3*r)-3*(t-5*b-3*r-s));
	}
}

C++: #include<iostream>
#include<set>
#include<vector>
#include<algorithm>


using namespace std;

typedef pair<int,char> P;

int main()
{
	int b,r,g,c,s,t;
	while(cin>>b>>r>>g>>c>>s>>t,b|r|g|c|s|t){
		int res=100;
		
		res+=77*b; t-=b*6;
		res+=51*r; t-=r*4;
		res+=4*g;  t-=g;
		res+=-1*c; t-=c;
		res+=0*s;  t-=s;
		
				
		res-=t*3;
		
		cout<<res<<endl;
	}
	
	return 0;
}

C++: // 2011/07/27 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int b, r, g, c, s, t;
		cin >> b >> r >> g >> c >> s >> t;
		if(b==0&&r==0&&g==0&&c==0&&s==0&&t==0)
			break;

		int med = 100;			// _ÌiúlÍ100j

		med += (15+(15-2)*5)*b;		// rbO{[iXÉæé
		med += (15+(15-2)*3)*r;		// M[{[iXÉæé
		med += 7*g;			// uhEÉæé
		med += 2*c;			// `F[Éæé

		med -= 3*(t-5*b-3*r-s);		// Q[Éæé¸

		cout << med << endl;
	}

	return 0;
}