Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for i := 0; i < 9; i++ {
		scanner.Scan()
		buf := strings.Split(scanner.Text(), " ")
		name := buf[0]
		am, _ := strconv.Atoi(buf[1])
		pm, _ := strconv.Atoi(buf[2])
		visitor := am + pm
		income := am*200 + pm*300
		fmt.Printf("%s %d %d\n", name, visitor, income)
	}
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const int INF = 10000;

struct edge{int to,cost;};
typedef pair<int,int> P;//firstは最短距離,secondは頂点番号


int main(){
	string str;
	int m,a;
	
	REP(i,9){
		cin>>str>>m>>a;
		cout<<str<<" "<<m+a<<" "<<m*200+a*300<<endl;
	}
	return 0;
}

C++: #include <stdio.h>
int main (void){
    int am,pm,i,nin,gaku;
    char cl[16];
    for(i=0;i<9;i++){
        scanf("%s%d%d",cl,&am,&pm);
        nin=am+pm;
        gaku=am*200+pm*300;
        printf("%s %d %d\n",cl,nin,gaku);
    }
return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
struct visitor{
	string str;
	int morning;
	int afternoon;
	long price;
};

int main(){
	struct visitor v[9];
	for(int i=0;i<9;i++){
		cin>>v[i].str>>v[i].morning>>v[i].afternoon;
		v[i].price = v[i].morning*200+v[i].afternoon*300;
	}
	for(int i=0;i<9;i++){
		cout<<v[i].str<<" "<<v[i].morning+v[i].afternoon<<" "<<v[i].price<<endl;
	}

	return 0;
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	string s;
	while(getline(cin,s)){
		stringstream ss;
		ss<<s;
		string s1;
		ss>>s1;
		cout<<s1<<" ";
		int a,b,c=0;
		cin>>a>>b;
		cout<<a+b<<" ";
		cout<<a*200+b+300<<endl;
	}
}



}
main() try{
    mainmain();
}
catch(...){
}

C++: #include<iostream>
#include<string>
#include<stdio.h>
#include<cstdio>
#include<math.h>
using namespace std;
int main(){
    string name[9];
    int am[9],pm[9],sum[9],syuunyuu[9];
    for(int i=0;i<9;i++){
        cin>>name[i]>>am[i]>>pm[i];
        sum[i]=am[i]+pm[i];
        syuunyuu[i]=(am[i]*200)+(pm[i]*300);
    }
    for(int i=0;i<9;i++){
        cout<<name[i]<<" "<<sum[i]<<" "<<syuunyuu[i]<<endl;
    }
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 999999
using namespace std;
int main(){
    char clase[20];
    int am,pm;
    while(scanf("%s%d%d",clase,&am,&pm)!=EOF)cout<<clase<<" "<<am+pm<<" "<<am*200+pm*300<<endl;
    return 0;
}

C++: #include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
  rep(i,9){
    string s;
    int in,a,b;
	cin>>s>>a>>b;
	in=a*200+b*300;
	a+=b;
	cout<<s<<" "<<a<<" "<<in<<endl;
  }
}

C++: #include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main(){
    for(int i = 0; i < 9; i++){
        string a;
        cin >> a;
        int x,y;
        scanf("%d%d",&x,&y);
        cout << a << ' ' << (x+y) << ' ' << (x*200)+(y*300) << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main(){
    int i,j,a[9],b[9];
    string name[9];
    for(i=0;i<9;i++){
        cin>>name[i]>>a[i]>>b[i];
        cout<<name[i]<<" "<<a[i]+b[i]<<" "<<a[i]*200+b[i]*300<<endl;
    }
    return 0;
}

C++: #include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>
#include <complex>
#include <iostream>
#include <iterator>

using namespace std;

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

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main()
{
	rep(i, 9){
		char name[16];
		int am, pm;
		scanf("%s%d%d\n", name, &am, &pm);
		printf("%s %d %d\n", name, am+pm, 200*am + 300*pm);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
    string s;
    int a, b;

    for(int i = 0; i < 9; i++){
        cin >> s >> a >> b;
        cout << s << " " << a+b << " " << 200*a + 300*b << endl;
    }

    return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int g[1000],k[1000],i,w[1000],z[1000];
	char n[1000][1000];
	for(i=0;i<9;i++){
		scanf("%s %d %d",n[i],&g[i],&k[i]);
	}	
	for(i=0;i<9;i++){
		z[i]=g[i]+k[i];
		w[i]=g[i]*200+k[i]*300;
	}
	for(i=0;i<9;i++){
		printf("%s %d %d\n",n[i],z[i],w[i]);
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){

	int a,b;
	string c;
	for(int i=0;i<9;i++){
        cin>>c>>a>>b;
        cout<<c<<" "<<a+b<<" "<<a*200+b*300<<endl;
	}


	return 0;
}