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 <stdio.h>
#include <iostream>
#include <string>
using namespace std;


int main () {

const int num_class = 9;

string classname[num_class];
int am[num_class];
int pm[num_class];

for (int i = 0 ; i < num_class;i++) {
    cin >> classname[i] >> am[i] >> pm[i];
    // cout << classname[i] << " " << am[i] << " " << pm[i] << "\n";
}



for (int i = 0;i < num_class;i++) {

    if (am[i] <= 400) {
    cout << classname[i] << " " << am[i] * 200;
    }
    else {
    cout << classname[i] << " " << 400 * 200;
    }


    if (pm[i] <= 400) {
    cout << " " <<am[i] * 300;
    }
    else {
    cout << " " <<400 * 300;
    }
    cout << "\n";
}


  return 0;
}

C++: #include <bits/stdc++.h>
#define log(x) cout<<x<<endl
#define pb push_back
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
using Graph=vector<vector<int>>;

int gcd(lint x, lint y){
  return y==0 ? x:gcd(y,x % y);
}

int digsum(int n) {
  int res = 0;
  while(n > 0) {
    res += n%10;
    n /= 10;
  }
  return res;
}

int dignum(int n) {
  int res = 0;
  while(n > 0) {
    res++;
    n /= 10;
  }
  return res;
}

int stringcount(string s, char c) {
  return count(s.cbegin(), s.cend(), c);
}

int lcm(lint x, lint y){
  return x/ gcd(x, y) * y;
}

int combi(int n, int r){
  int num = 1;
  for(int i = 1; i <= r; i++){
    num = num * (n - i + 1) / i;
  }
  return num;
}

int main(){
  string l[10];
  vector<pair<int,int>> m;
  int n=9;
  rep(i,n){
    string s,r;
    pair<int,int> t;
    int a,b;
    cin>>s>>a>>b;
    l[i]=s;
    t.first=a+b;
    t.second=a*200+b*300;
    m.pb(t);
  }
  rep(i,n){
    cout<<l[i]<<" "<<m[i].first<<" "<<m[i].second<<endl;
  }
  return 0;
}

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

C++: #include <cstdio>

int main(){
  char str[16];
  int a,b;

  for(int i = 0 ; i < 9 ; i++){
    scanf("%s %d %d" ,str ,&a ,&b);
    printf("%s %d %d\n" ,str ,a + b , a*200+b*300);
  }

  return 0;
}

C++: #include<iostream>
#include<string>

int main()
{
	for( int i = 0; i != 9; ++i )
	{
		std::string s;
		int a, b;
		std::cin >> s >> a >> b;
		std::cout << s << ' ' << a + b << ' ' << a * 200 + b * 300 << std::endl;
	}

	return 0;
}

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
#define sz size()

const double EPS = 1e-10;
const int INF = 100000000;

int main(){
    string s;
    int a,b;
    while(cin>>s>>a>>b){
        cout<<s<<" "<<a+b<<" "<<a*200+b*300<<endl;
    }
    return 0;
}

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

C++: #include<stdio.h>
int main(void)
{
	char a;
	int s,z,i,f,g;
		while(scanf("%s %d %d",&a,&s,&z)!=EOF){
			f=s+z;
			g=(s*200)+(z*300);
			printf("%c %d %d\n",a,f,g);
			s=0;
			z=0;
			f=0;
			g=0;
		}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <cstdio>

using namespace std;

int main(void){
	string str;
	while(getline(cin,str)){
		istringstream iss(str);
		string n;
		int a,p;
		iss >> n >> a >> p;
		printf("%s %d %d\n",n.c_str(),a+p,200*a+300*p);
	}
}

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

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

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;
		ss>>a>>b;
		cout<<a+b<<" ";
		cout<<a*200+b+300<<endl;
	}
}



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

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

int main() {
	long long a,b;
	string s;
	
	while(cin>>s){
		cin>>a>>b;
		cout<<s<<" "<<a+b<<" "<<a*200+b*300<<endl;
	}
	
	return 0;
}

C++: #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
  int a,b;
  string s;
  for(;;){
    s="";
    cin>>s;
    if(s.empty())
      break;
    cin>>a>>b;
    cout<<s<<" "<<a+b<<" "<<a*200+b*300<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
    for(int i=0;i<9;i++){
        string str;
        cin>>str;
        int before,after;
        cin>>before>>after;
        cout<<str<<" "<<before+after<<" "<<before*200+after*300<<endl;
    }
    return 0;
}