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

// debug case 2: 可用字符就这么几个 -> 不是这个原因
int is_ok(char ch) {
  if (('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z')
      || ('0' <= ch && ch <= '9')
      || (ch == ',' || ch == '.' || ch == '-' || ch == '+' || ch == '_'))
    return 1;
  return 0;
}

int main() {
  string bad, input;
  getline(cin, bad); cin >> input;  // debug: 改用空行
  // cin >> bad >> input;           // case2: 通不过的原因, 第一行可能是空行
  for (int i = 0; i < input.length(); i++) {
    int ok = 1;
    if (!is_ok(input[i])) continue;
    for (int j = 0; j < bad.length(); j++) {
      if (input[i] == bad[j]) {ok = 0; break;}   // 直接对应相等
      if (isalpha(input[i]) && (toupper(input[i]) == bad[j]))  {
        ok = 0; break;       // 字符i是字母, 转成大写对应相等
      }
      if (bad[j] == '+' && isupper(input[i])) {
        ok = 0; break;       // 坏键是+, 对应i是大写
      }
    }
    if (ok) cout << input[i];
  }
  cout << "\n";
  return 0;
}

#include <iostream>
#include <string>
using namespace std;
int main() {
  string bad, should;
  getline(cin, bad);
  getline(cin, should);
  for (int i = 0; i < should.length(); i++) {
    if (bad.find(toupper(should[i])) != string::npos) continue;
    if (isupper(should[i]) && bad.find('+') != string::npos) continue;
    cout << should[i];
  }
  return 0;
}

#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 100050;
int scores[MAXN];

int main() {
  int N, max_i = -1, max_score = -1;
  // memset(scores, 0, sizeof(scores));   // 这句造成编译错误
  cin >> N;
  for (int i = 0; i < N; i++) {
    int j, tmp_s;
    cin >> j >> tmp_s;
    scores[j] += tmp_s;
    if (scores[j] > max_score) { max_i = j; max_score = scores[j];}
  }
  cout << max_i << " " << max_score << "\n";
  return 0;
}

*****
 ***
  *
 ***
*****
2

// 计算前31项奇数之和

#include <stdio.h>

int main() {
  int n; char ch;
  scanf("%d %c", &n, &ch);
  int i, j = 1, sum = 1, p;
  for (i = 0; i < 31; i++) {
    j += 2;
    sum += j*2;
    if (sum > n) {p = n - (sum-(j*2)); break;}
  }
  int line = i--;
  // 上打印line行, 下打印line-1行
  for (int i = line; i >= 0; i--) {
    for (int j = 0; j < line-i; j++) printf(" ");
    for (int j = 0; j < 1+i*2; j++) printf("%c", ch);
    printf("\n");
  }
  for (int i = 1; i <= line; i++) {
    for (int j = 0; j < line-i; j++)  printf(" ");
    for (int j = 0; j < 1+i*2; j++) printf("%c", ch);
    printf("\n");
  }
  printf("%d\n", p);

  return 0;
}

#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;

int main() {
  double c1, c2;
  scanf("%lf %lf", &c1, &c2);
  double c = (c2-c1) / 100;

  int h, m, s;
  h = c/3600;
  c = c-h*3600;
  m = c/60;
  c = c-m*60;
  s = floor(c+0.5);
  printf("%02d:%02d:%02d\n", h, m, s);
  return 0;
}

int tm[3];
const int CT = 100;

int main() {
  double c1, c2;
  scanf("%lf %lf", &c1, &c2);
  double s = (c2 - c1) / CT;
  cout << s << endl;
  int hh, mm, ss;
  hh = s/3600;
  mm = (s/3600-hh)*3600/60;
  ss = floor(((s/3600-hh)*3600/60 - mm) * 60 + 0.5);
  printf("%02d:%02d:%02d\n", hh, mm, ss);
  return 0;
}

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

int main() {
  char c;
  c = getchar();
  if (c == '-') cout << "-";
  string s;     // 数组和小数点部分
  int in = 0, fn = 0, ok = 0;   // 科学计数法的整数和小数部分个数, 转换标示
  while ((c = getchar()) && c != 'E') {
    if (c == '.') {ok = 1; continue;}
    s.push_back(c);
    ok ? fn++ : in++;
  }
  // 读第二个正负号
  c = getchar();
  int flag = (c == '+') ? 0 : 1;
  // 读syb_n字符
  vector<int> syb_v;
  while ((c = getchar()) && (c != '\n') && (c != '\r')) {
    syb_v.push_back(c - '0');
  }
  // 计算syb_n
  int syb_n = 0, k = 1;
  for (int i = syb_v.size() - 1; i >= 0; i--) {
    syb_n += k * syb_v[i];
    k *= 10;
  }

  int front = syb_n-in+1, back = syb_n-fn;
  if (flag == 1) {
    if (front > 0) cout << "0.";
    for (int i = 0; i < front-1; i++) cout << "0";
    cout << s;
  }
  if (flag == 0) {
    if (back < 0) {
      int len = s.size();
      for (int i = 0; i < len; i++) {
        if (i == len+back) cout << ".";
        cout << s[i];
      }
    } else {
      cout << s;
      for (int i = 0; i < back; i++) cout << "0";
    }
  }
  cout << "\n";
  return 0;
}

#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

struct Cake {
  double num, tot;
  double each_d;
};

struct cmp {
  bool operator () (const Cake c1, const Cake c2) const {
    return c1.each_d <= c2.each_d;     // 每吨的价格越高权重越高
  }
};
vector<Cake> cakes;
priority_queue<Cake, vector<Cake>, cmp > dq;


int main() {
  int N, D;   // 种类数和市场需求
  cin >> N >> D;
  for (int i = 0; i < N; i++) {
    Cake tmp_c;
    cin >> tmp_c.num;
    cakes.push_back(tmp_c);
  }
  for (int i = 0; i < N; i++) {
    cin >> cakes[i].tot;
    cakes[i].each_d = cakes[i].tot / cakes[i].num;
    dq.push(cakes[i]);
  }
  double ans = 0;
  int now_d = 0;
  for (;;) {
    // debug case3: 如果都供应完了, 还没达到市场需求的情况
    if (dq.empty()) break;
    Cake cmax = dq.top();
    if (D - now_d >= cmax.num) {   // 如果需求量比当前最有优价格的供货量大
      now_d += cmax.num;
      ans += cmax.each_d * cmax.num;
    } else {    // 只需要提供一部分
      ans += (D - now_d) * cmax.each_d;
      now_d = D;    // 供应部分后, 满足市场需求
      break;
    }
    dq.pop();   // 队首月饼供应完毕
  }
  printf("%.2lf\n", ans);
  return 0;
}

#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

struct food {
  double scale, each_scale;
  double cnt;
};

struct cmp {
  bool operator() (const food &f1, const food &f2) {
    return f1.each_scale < f2.each_scale;
  }
};

bool db_equal(const double d1, const double d2) {
  return -0.0005 < d1-d2 && d1-d2 < 0.00005;
}

int main() {
  int N;
  double need; scanf("%d %lf", &N, &need);
  vector<food> v(N);
  priority_queue<food, vector<food>, cmp> q;
  for (int i = 0; i < N; i++) {
    scanf("%lf", &v[i].cnt);
  }
  for (int i = 0; i < N; i++) {
    scanf("%lf", &v[i].scale);
    v[i].each_scale = v[i].scale / v[i].cnt;
    q.push(v[i]);
  }
  double profit = 0.0;
  while (!db_equal(need, 0.0) && !q.empty()) {
    if (q.top().cnt > need) {
      profit += q.top().each_scale * need;
      need = 0;
    } else {  // <= need
      profit += q.top().scale;
      need -= q.top().cnt;
      q.pop();
    }
    if (q.empty()) break;
  }
  printf("%.2lf", profit);
  return 0;
}

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

bool cmp_str1(const char a, const char b) { return a >= b;}

bool cmp_str2(const char a, const char b) { return a <= b;}


int convert_int(string s) {
  // 从(末尾*10+前一位)*10
  int i = 1, ans = 0;
  for (string::iterator p = s.end()-1; p >= s.begin(); p--) {
    ans += (*p - '0') * i;
    i *= 10;
  }
  // cout << ans << "\n";
  return ans;
}

string convert_str(int h) {
  // 转成4位字符串,
  string ans_s(4, '0');
  int i = 3;
  while (h) {
    ans_s[i--] = h % 10 + '0';
    h /= 10;
  }
  return ans_s;
}

int main() {
  string s1;
  cin >> s1;
  s1 = convert_str(convert_int(s1));   // debug: 0~999需要处理
  string s2 = s1;
  sort(s1.begin(), s1.end(), cmp_str1);
  sort(s2.begin(), s2.end(), cmp_str2);
  if (s1 == s2) {
    cout << s1 << " - " << s1 << " = 0000" << "\n"; return 0;
  }
  while (s1 != "6174") {
    s2 = s1;
    sort(s1.begin(), s1.end(), cmp_str1);
    sort(s2.begin(), s2.end(), cmp_str2);
    int d = convert_int(s1) - convert_int(s2);
    string tmp = convert_str(d);               // debug:按照四位格式输出
    cout << s1 << " - " << s2 << " = " << tmp << "\n";
    s1 = tmp;
  }

  return 0;
}

#include <cstdio>
#include <cstring>
using namespace std;

char bs[1050];
int ans[1050];
int cnt = 0;

int main() {
  int b, q = 0, r = 0;
  scanf("%s %d", bs, &b);
  int len = strlen(bs);
  for (int i = 0; i < len; i++) {
    int x = r * 10 + bs[i] - '0';
    q = x / b;
    r = x % b;
    if (i == 0 && q == 0) continue;
    ans[cnt++] = q;
  }
  if (cnt == 0 && ans[0] == 0) printf("0");
  for (int i = 0; i < cnt; i++) { printf("%d", ans[i]); }
  printf(" %d\n", r);
  return 0;
}

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


int main() {
  string a; int b;
  cin >> a >> b;
  int len = a.length();
  int f = (a[0] - '0') / b;
  if ((f != 0 && len > 1)|| len == 1)
    cout << f;
  int temp = (a[0] - '0') % b;
  for (int i = 1; i < len; i++) {
    f = (temp * 10 + a[i] - '0') / b;
    cout << f;
    temp = (temp * 10 + a[i] - '0') % b;
  }
  cout << " " << temp << "\n";
  return 0;
}