/*
 * author:  ADMathNoob
 * created: 05/07/24 20:41:26
 * problem: https://qoj.ac/problem/2300#tab-statement
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  
  long long km, kd, kc, kl, kx, kv, ki;
  cin >> km >> kd >> kc >> kl >> kx >> kv >> ki;

  auto Works = [=](long long T) -> map<string, long long> {
    vector<pair<string, long long>> row4;
    long long u4 = T;
    long long M = km;
    long long uMMM = min(M / 3, u4);
    M -= 3 * uMMM;
    u4 -= uMMM;
    row4.emplace_back("MMM", uMMM);
    if (u4 > 0) {
      assert(M < 3);
      row4.emplace_back(string(M, 'M'), 1);
      M = 0;
    }
    
    auto Do = [=](long long i, long long v, long long x) -> pair<vector<pair<string, long long>>, long long> {
      // returns the number of i's required left
      vector<pair<string, long long>> row;
      long long rem = T;
      if (x > i) return {{}, -1};
      rem -= x;
      i -= x;
      row.emplace_back("IX", x);
      // done x
      
      long long uVIII = min(v, i / 3);
      rem -= uVIII;
      row.emplace_back("VIII", uVIII);
      v -= uVIII;
      i -= 3 * uVIII;
      if (v > 0) {
        if (i == 2) {
          row.emplace_back("VII", 1);
          v -= 1;
          rem -= 1;
          i = 0;
        } else if (i == 1) {
          row.emplace_back("VI", 1);
          v -= 1;
          rem -= 1;
          i = 0;
        }
        row.emplace_back("V", v);
        rem -= v;
      }
      
      if (rem < 0) return {{}, -1};
      long long uIII = min(i / 3, rem);
      rem -= uIII;
      i -= 3 * uIII;
      row.emplace_back("III", uIII);
      if (rem == 0) {
        return {row, i};
      }
      row.emplace_back(string(i, 'I'), 1);
      return {row, 0};
    };
    
    auto RemoveZeros = [](vector<pair<string, long long>> row) {
      vector<pair<string, long long>> a;
      for (auto [s, cnt] : row) {
        if (cnt > 0) {
          a.emplace_back(s, cnt);
        }
      }
      return a;
    };
    
    auto Replace = [](vector<pair<string, long long>>& row, char ci, char cv, char cx) {
      for (auto& [s, cnt] : row) {
        for (char& c : s) {
          if (c == 'I') c = ci;
          else if (c == 'V') c = cv;
          else if (c == 'X') c = cx;
        }
      }
    };
    
    auto [row3, C] = Do(kc, kd, M);
    if (C == -1) return {};
    row3 = RemoveZeros(row3);
    Replace(row3, 'C', 'D', 'M');

    auto [row2, X] = Do(kx, kl, C);
    if (X == -1) return {};
    row2 = RemoveZeros(row2);
    Replace(row2, 'X', 'L', 'C');

    auto [row1, I] = Do(ki, kv, X);
    if (I != 0) return {};
    row1 = RemoveZeros(row1);
    row4 = RemoveZeros(row4);
    
    vector<int> ptr(4, 0);
    vector<vector<pair<string, long long>>> rows = {row1, row2, row3, row4};
    map<string, long long> ret;
    while (true) {
      bool done = [&] {
        for (int j = 0; j < 4; j++) {
          if (ptr[j] < rows[j].size()) {
            return false;
          }
        }
        return true;
      }();
      if (done) {
        break;
      }
      long long mn = 1e18;
      for (int j = 0; j < 4; j++) {
        if (ptr[j] < rows[j].size()) {
          mn = min(mn, rows[j][ptr[j]].second);
        }
      }
      
      string use = "";
      for (int j = 3; j >= 0; j--) {
        if (ptr[j] < rows[j].size()) {
          use += rows[j][ptr[j]].first;
          rows[j][ptr[j]].second -= mn;
          if (rows[j][ptr[j]].second == 0) {
            ptr[j] += 1;
          }
        }
      }
      ret[use] += mn;
    }
    return ret;
  };
  
  long long low = 1, high = 1e18;
  while (low < high) {
    long long mid = (low + high) / 2;
    auto res = Works(mid);
    if (!res.empty()) {
      high = mid;
    } else {
      low = mid + 1;
    }
  }
  auto res = Works(low);
  cout << low << '\n';
  cout << res.size() << '\n';
  for (auto [s, cnt] : res) {
    cout << s << ' ' << cnt << '\n';
  }
  return 0;
}