#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <cmath>
#include <fstream>
#include <string>
#include <iomanip>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define ll long long
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define all(a) a.begin(), a.end()
#define PI 3.141592653589793238462643383279502884197169399375105820974

typedef vector <pair <int ,int > > vpii;
typedef vector <pair <ll ,ll > > vpll;
typedef vector <pair <double ,double > > vpdd;
typedef vector<int> vi;
typedef vector <ll> vl;
typedef vector <char> vc;
typedef vector <double> vd;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <double, double> pdd;
struct A{
  double a;
  double x;
  double y;
};
vector <A> sum(std::vector<A> a,  std::vector<A> b){
  int j = 0;
  for(int i = 0; i < a.size(); i++){
    for(j = 0; j < b.size(); j++){
      if(a[i].x == b[i].x && a[i].y == b[i].y){
        a[i].a += b[i].a;
      }
      else{
        a.pb(b[i]);
      }
    }
  }
  return a;
}
vector <A> vich(std::vector<A> a,  std::vector<A> b){
  int j = 0;
  for(int i = 0; i < a.size(); i++){
    for(j = 0; j < b.size(); j++){
      if(a[i].x == b[i].x && a[i].y == b[i].y){
        a[i].a -= b[i].a;
      }
      else{
        b[i].a *= -1;
        a.pb(b[i]);
      }
    }
  }
  return a;
}
int main() {
vector <A> lol[8];
double buf1, buf2, buf3,buf4;
int key1, key2, key3, key4 = 0;
A buff_value;
//cout << int('0');
int j = 0;
  vector<string> a;
  std::string s;

    std::ifstream in("input.txt"); // окрываем файл для чтения
    if (in.is_open())
    {
        while (getline(in, s, ';'))
        {
          for (int i = 0; i < s.size() - 1; i++){
            if(key1 == 1 && key3 == 1 && key4 == 1){
              lol[j].push_back(buff_value);
            }
            if((s[i] >= '0' && s[i] <= '9') && (s[i + 1] >= '0' && s[i + 1] <= '9') && key1 == 0){
              buf1 = 10 * (int(s[i]) - 48) + int(s[i + 1] - 48);
              buff_value.a = buf1;
              key1 = 1;
            }
            else if ((s[i] >= '0' && s[i] <= '9') && (s[i + 1] >= '0' && s[i + 1] <= '9') && key1 == 0){
              buf1 = int(s[i] - 48);
              buff_value.a = buf1;
              key1 = 1;
            }
            else if (s[i] == '^' && key1 == 0){
              buff_value.x = ((int)s[i + 1] - 48);
              key3 = 1;
            }
            else if(s[i] == '^' && key1 == 1){
              buff_value.y = ((int)s[i + 1] - 48);
              key4 = 1;
            }
          }
        }
    }
}