map<string, long double MAP;

int main()
{
 make_map();
 input_parameters();
 sum = make_array_of_sum();
 FS  = make_array_of_(0.34/sum[i]);
 sort(F);
 for (int i = 0; i < M; ++i)
 {
  input(NOTA);

  F0 = MAP[NOTA];
  F = find_closest(FS, F0);
  state = mask_for(F);
  output(state);
  NOMER = (int)ceil(2 * L / sum_for(F));
  output(NOMER);
  output(12 * abs(log(F0 / F) / log(2.0)));
 }
 return 0;
}