#include <cstdio>
int main() {
  int M, N;
  scanf("%d %d", &M, &N);
  int a, b, rp, tmp;
  scanf("%d %d %d", &a, &b, &rp);
  for (int i = 0; i < M; i++) {
    if (i) printf("\n");
    for (int j = 0; j < N; j++) {
      scanf("%d", &tmp);
      if (j) printf(" ");
      if (a <= tmp && tmp <= b) {
        printf("%03d", rp);
      } else {
        printf("%03d", tmp);
      }
    }
  }
  return 0;
}

#include <string.h>
strcmp(str1, str2);      // str1字典序比str2小, 返回负值, 具体看差值; 相等为0

char a[50], b[50];
double tmp;
scanf("%s", a);             // 12.3.2
sscanf(a, "%lf", &tmp);     // 12.3
sscanf(b, "%.2lf", tmp);    // 12.30
int flag = 0;     // 用于记录转换前后的字符数组是否相等
for (int i = 0; i < strlen(a); i++) {
  if (a[i] != b[i]) flag = 1; break;
}

#include <iostream>
#include <cstring>
#include <string.h>
using namespace std;

int main() {
  int N; scanf("%d", &N);
  char s[50], b[50];
  int cnt = 0; double sum = 0, tmp;
  while (N--) {;
    scanf("%s", s);
    sscanf(s, "%lf", &tmp);
    sprintf(b, "%.2lf", tmp);
    int flag = 0;
    for (int i = 0; i < strlen(s); i++) {
      if (s[i] != b[i]) { flag = 1; break;}
    }
    if (flag || tmp < -1000 || tmp > 1000) {
      printf("ERROR: %s is not a legal number\n", s);
    } else {
      sum += tmp; cnt++;
    }
  }

  if (!cnt) {
    printf("The average of 0 numbers is Undefined\n");
  } else if (cnt == 1) {
    printf("The average of 1 number is %.2lf\n", sum);
  } else {
    printf("The average of %d numbers is %.2lf\n", cnt, sum/cnt);
  }
  return 0;
}

#include <iostream>
#include <string>
using namespace std;

int main() {
  int N; cin >> N;
  int cnt = 0; double sum = 0;
  while (N--) {
    string s; cin >> s;
    int ok = 1, point_cnt = 0, pt_pos = 0;
    for (int i = 0; i < s.length(); i++) {
      if (s[i] == '-' || s[i] == '+') {
        if (i != 0) { ok = 0; break;}
      }

      if (s[i] == '.') {
        pt_pos = i;
        point_cnt++;
        if (point_cnt > 1) { ok = 0; break;}
      }

      if (isalpha(s[i])) {ok = 0; break;}
    }
    if (ok && (!point_cnt)) {
      double d = stod(s);
      if (d+1000 < 0.005 || d-1000 > 0.005) ok = 0;
    }

    if (ok && point_cnt) {
      int len = s.length() - pt_pos - 1;
      if (len > 2) ok = 0;
    }

    if (!ok) {
      cout << "ERROR: " << s <<" is not a legal number" << endl;
    } else {
      sum += stod(s);
      cnt++;
    }
  }
  if (!cnt) {
    cout << "The average of 0 numbers is Undefined" << endl;
  } else if (cnt == 1) {
    printf("The average of 1 number is %.2lf\n", sum);
  } else {
    printf("The average of %d numbers is %.2lf\n", cnt, sum/cnt);
  }
  return 0;
}

string s = "abcd";
string tmp = s.substr(0, 2);
cout << tmp << endl;      // ab
tmp = s.substr(1, 2);
cout << tmp << endl;      // bc

#include <iostream>
#include <vector>
#include <string>
using namespace std;

vector<vector<string> > emoji;
int order[6] = {0, 1, 2, 1, 0};

int main() {
  for (int k = 0; k < 3; k++) {
    string s;
    getline(cin, s);
    int n = s.length();
    vector<string> row;
    int i = 0, j = 0;
    while (i < n) {
      if (s[i] == '[') {
        string tmp_s;
        j = i+1;
        while (j < n && s[j] != ']') j++;
        tmp_s = s.substr(i+1, j-i-1);                 // bug02
        row.push_back(tmp_s);
        i = j;
      } else {
        i++;
      }
    }
    emoji.push_back(row);
  }

  int K; cin >> K;
  for (int k = 0; k < K; k++) {
    if (k) cout << endl;
    string ans_s; int ok = 1;
    for (int i = 0; i < 5; i++) {
      int tmp; cin >> tmp;
      int n = emoji[order[i]].size();
      // if (tmp < 0 || tmp > n-1) {                  // bug04
      if (tmp < 1 || tmp > n) {
        // cout << "Are you kidding me? @\\/@\n";     // bug01
        ok = 0;
        break;
      }
      if (i == 1) ans_s += "(";
      else if (i == 4) ans_s += ")";
      ans_s += emoji[order[i]][tmp-1];
    }
    if (ok) {
      cout << ans_s;
    } else {
      cout << "Are you kidding me? @\\/@";            // bug03
    }
  }
  return 0;
}

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main() {
  string A, B; cin >> A >> B;
  int M = A.length(), N = B.length();
  if (N < M) {
    B.insert(0, M-N, '0');
    N = M;
  } else if (N > M) {
    A.insert(0, N-M, '0');
    M = N;
  }
  string s, tmp_s;
  for (int i = 0; i < M; i++) {
    int x;
    int a = A[M-1-i] - '0', b = B[N-1-i] - '0';

    if ((i+1)%2) {
      x = (a+b) % 13;
      if (x == 10) {
        tmp_s = 'J';
      } else if (x == 11) {
        tmp_s = 'Q';
      } else if (x == 12) {
        tmp_s = 'K';
      } else {
        tmp_s = x + '0';
      }

    } else {
      x = b - a;
      if (x < 0) x += 10;
      tmp_s = x + '0';
    }
    s += tmp_s;
  }
  reverse(s.begin(), s.end());
  cout << s << endl;
  return 0;
}

#include <iostream>
#include <string>
using namespace std;


char md[15] = {'1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2'};
int weight[20] = {7, 9, 10, 5, 8,  4, 2, 1, 6, 3,  7, 9, 10, 5, 8, 4, 2};
int main() {
  int N, cnt = 0;
  scanf("%d", &N);
  while (N--) {
    string s; cin >> s;
    int ok = 1;
    int sum = 0;

    for (int i = 0; i < 17; i++) {
      if (isdigit(s[i])) {
        sum += (s[i]-'0') * weight[i];
      } else {
        ok = 0; break;
      }
    }

    if (!ok) {
      cout << s << endl; cnt++;
    } else {
      int Z = sum % 11;
      if (md[Z] != s[17]) {
        cout << s << endl; cnt++;
      }
    }
  }
  if (cnt == 0) {
    cout << "All passed" << endl;
  }

  return 0;
}

class Solution {
 public:
  int maxProfit(vector<int>& prices) {
    if (prices.size() == 0 || prices.size() == 1) return 0;
    int profit = 0, flag = 0, min;
    for (int i = 1; i < prices.size(); i++) {
      if (!flag && prices[i] > prices[i-1]) {
        min = prices[i-1]; flag = 1;
      } else if (flag) {
        if (prices[i] < prices[i-1]) {
          profit += prices[i-1] - min; flag = 0;
        } else if (i == prices.size() - 1) {
          profit += prices[i] - min;
        }
      }
    }
    return profit;
  }
};

/*
Wrong answer
Input:
[1,2]
Output:
0
Expected:
1
*/

// Time:O(n), Space:O(1)
class Solution {
 public:
  int maxProfit(vector<int>& prices) {
    if (prices.size() == 0 || prices.size() == 1) return 0;
    int profit = 0, flag = 0, min;
    for (int i = 1; i < prices.size(); i++) {
      if (!flag && prices[i] > prices[i-1]) {
        min = prices[i-1]; flag = 1;
        if (i == prices.size()-1) {
          profit += prices[i] - min;
        }
      } else if (flag) {
        if (prices[i] < prices[i-1]) {
          profit += prices[i-1] - min; flag = 0;
        } else if (i == prices.size() - 1) {
          profit += prices[i] - min;
        }
      }
    }
    return profit;
  }
};

class Solution {
 public:
  int removeDuplicates(vector<int>& nums) {
    int n = nums.size();
    if (n == 0) return n;
    int i = 0;
    while (i < n) {
      int j = i + 1;
      while (j < n && nums[j] == nums[j-1]) j++;
      n -= j - i- 1;
      for (int p = i+1, q = 0; q < n; p++, q++) {
        nums[p] = nums[j+q];
      }
      i++;
    }
    return n;
  }
};  // 实现了一个蠢萌版本

class Solution {
 public:
  int removeDuplicates(vector<int>& nums) {
    int n = nums.size();
    if (n == 0) return n;

    int j = 1;
    for (int i = 1; i < n; i++) {
      if (nums[i] != nums[j-1]) {
        int tmp = nums[i]; nums[i] = nums[j]; nums[j] = tmp;
        j++;
      }
    }
    return j;
  }
};  // 精简了几个指针, 只对数组做一遍的扫描, Time:O(n), Space:O(1), 但不用交换赋值就可以

// Time: O(n), Space: O(1)
class Solution {
 public:
  int removeDuplicates(vector<int>& nums) {
    if (nums.size() == 0) return 0;

    int i = 0;
    for (int j = 1; j < nums.size(); j++) {
      if (nums[j] != nums[i]) {
        i++;
        nums[i] = nums[j];
      }
    }
    return i+1;
  }
};

v.push_back(Node{it->second.name, (int)it->second.score, it->second.num});

map<string, double> sum;
map<string, int> num;

mp.count(key);  // 包含返回1, 不包含返回0
mp.find(key);   // 返回迭代器, 如果迭代器是mp.end()说明不存在.

// 第一种方法count(key)
if (!mp.count(id)) {
  mp[school].name = school;    // 两次查找
}

// 第二种方法find(key)
auto it = mp.find(id);
if (it == mp.end()) {
  it->second.name = school;    // 一次查找
}

if ((mp.find(id)->second.name).empty()) {   // why?
  mp[school].name = school;
}

for (auto it = mp.begin(); it != mp.end(); it++) {
  Node node;
  node.name = it->second.name;
  node.score = (int)it->second.score;    // important!
  node.num = it->second.num;
  v.push_back(node);
}

v.push_back(Node{it->first, (int)sum[it->first], num[it->first]});

struct Node {
  string name;
  int score;        // int score = 0;   这样不能用上述Node{a, b, c}方法构造了.
  int num;
};

#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;

struct Node {
  string name;
  int score;
  int num;
};

unordered_map<string, Node> mp;
unordered_map<string, double> sum;
unordered_map<string, int> num;

vector<Node> v;   // bug01

bool cmp(Node n1, Node n2) {
  if (n1.score != n2.score) return n1.score >= n2.score;
  if (n1.num != n2.num) return n1.num < n2.num;
  return n1.name < n2.name;
}

int main() {
  int N; scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    string id, school; double score;
    cin >> id;
    scanf("%lf", &score);
    cin >> school;
    for (int i = 0; i < school.length(); i++) {
      school[i] = tolower(school[i]);
    }
    if (id[0] == 'B') {
      score = score / 1.5;
    } else if (id[0] == 'T') {
      score = score * 1.5;
    }
    if (!mp.count(school)) {
      mp[school].name = school;
    }
    sum[school] += score;   // bug05
    num[school]++;
  }
  for (auto it = mp.begin(); it != mp.end(); it++) {
    v.push_back(Node{it->first, (int)sum[it->first], num[it->first]});
  }
  // case7在排序时候已经在比较score
  sort(v.begin(), v.end(), cmp);

  cout << v.size() << endl;                 // bug07
  int r = 1;
  cout << r << " " << v[0].name << " " << v[0].score << " " << v[0].num << endl;
  for (int i = 1; i < v.size(); i++) {
    if (v[i].score != v[i-1].score) {
      r = i + 1;
    }
    cout << r << " " << v[i].name << " " << v[i].score << " " << v[i].num << endl;
  }
  return 0;
}

#include <iostream>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <cmath>
using namespace std;


struct Node_a {
  string school;
  double full_score;
  int num;
};

struct Node_b {
  double score;
  int num;
};

int db_equal(double d1, double d2) {
  return (-0.005 < d1 - d2) && (d1-d2 < 0.005);
}

/*
bool cmp(Node_a n1, Node_a n2) {
  if (!(db_equal(n1.full_score, n2.full_score))) return n1.full_score > n2.full_score;
  if (n1.num != n2.num) return n1.num < n2.num;
  return n1.school < n2.school;
}
*/
bool cmp(Node_a n1, Node_a n2) {
  if ((int)n1.full_score != (int)n2.full_score) return (int)n1.full_score > (int)n2.full_score;
  if (n1.num != n2.num) return n1.num < n2.num;
  return n1.school < n2.school;
}

int main() {
  int N; cin >> N;
  unordered_map<string, Node_b> mp;
  while (N--) {
    string id, school; double score;
    cin >> id >> score >> school;
    for (int i = 0; i < school.length(); i++) {
      school[i] = tolower(school[i]);     // lower all school chars
    }
    // convert score;
    if (id[0] == 'B') {
      score = score / 1.5;
    } else if (id[0] == 'T') {
      score = score * 1.5;
    }
    auto it = mp.find(school);
    if (it != mp.end()) {
      it->second.score += score;
      it->second.num ++;
    } else {
      Node_b node;
      node.score = score; node.num = 1;
      mp[school] = node;     // why?
    }

  }
  vector<Node_a> v;
  for (auto it = mp.begin(); it != mp.end(); it++) {
    v.push_back({it->first, it->second.score, it->second.num});
  }
    
  sort(v.begin(), v.end(), cmp);
    
  cout << v.size() << endl;
  int rank = 1;
  cout << rank << " " << v[0].school << " " << (int)v[0].full_score << " " << v[0].num << endl;
  for (int i = 1; i < v.size(); i++) {
    if ((int)v[i].full_score != (int)v[i-1].full_score) rank = i+1;
    cout << rank << " " << v[i].school << " " << (int)v[i].full_score << " " << v[i].num << endl;
  }
  
  
  return 0;
}

#include <iostream>
#include <string>
using namespace std;

string reverse(string s) {
  string tmp;
  int n = s.length();
  for (int i = n-1; i >= 0; i--) {
    tmp += s[i];
  }
  return tmp;
}

int is_p(string s) {
  int n = s.length();
  for (int i = 0; i <= n / 2; i++) {
    if (s[i] != s[n-1-i]) return 0;
  }
  return 1;
}

long long re_stoi(string s) {
  long long ans = 0;
  int n = s.length(); long long b = 1;
  for (int i = n-1; i >= 0; i--) {
    ans += (s[i] - '0') * b;
    b *= 10;
  }
  return ans;
}

int main() {
  string A; cin >> A;
  int cnt = 0;
  if (is_p(A)) {
    cout << A << " is a palindromic number.\n";
  } else {
    for (;;) {
      string s1, s2;
      s1 = A;
      s2 = reverse(A);
      A = to_string(re_stoi(s1) + re_stoi(s2));         // bug case7
      cout << s1 << " + " << s2 << " = " << A << endl;  // bug1
      if (is_p(A)) {
        cout << A << " is a palindromic number.\n";
        break;
      }
      // 10755470 + 07455701 = 18211171
      // cout << s1 << " + " << s2 << " = " << A << endl;  // bug1
      if (++cnt == 10) {
        cout << "Not found in 10 iterations.\n"; break;
      }
    }
  }

  return 0;
}