Codeforces Round #299 (Div. 2)A B C 水 dfs 二分

A. Tavas and Nafas

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.

His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words.

He ate coffee mix without water again, so right now he's really messed up and can't think.

Your task is to help him by telling him what to type.

Input

The first and only line of input contains an integer s (0 ≤ s ≤ 99), Tavas's score.

Output

In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.

Examples

Input

6

Output

six

Input

99

Output

ninety-nine

Input

20

Output

twenty

Note

You can find all you need to know about English numerals in http://en.wikipedia.org/wiki/English_numerals .

题意：将0~99转换为单词表示

题解：标记一下。

 #include<bits/stdc++.h>
 using namespace std;
 #define ll __int64
 int n;
 map<int,string> mp;
 int main()
 {
     scanf("%d",&n);
     mp[]="zero";
     mp[]="one";
     mp[]="two";
     mp[]="three";
     mp[]="four";
     mp[]="five";
     mp[]="six";
     mp[]="seven";
     mp[]="eight";
     mp[]="nine";
     mp[]="ten";
     mp[]="eleven";
     mp[]="twelve";
     mp[]="thirteen";
     mp[]="fourteen";
     mp[]="fifteen";
     mp[]="sixteen";
     mp[]="seventeen";
     mp[]="eighteen";
     mp[]="nineteen";
     mp[]="twenty";
     mp[]="thirty";
     mp[]="forty";
     mp[]="fifty";
     mp[]="sixty";
     mp[]="seventy";
     mp[]="eighty";
     mp[]="ninety";
     if(n<=)
         cout<<mp[n]<<endl;
     else
     {
         int a,b;
         a=n/;
         b=n%;
         if(b>)
         cout<<mp[a*]<<"-"<<mp[b]<<endl;
         else
         cout<<mp[a*]<<endl;
     }
     return ;
 }

B. Tavas and SaDDas

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Once again Tavas started eating coffee mix without water! Keione told him that it smells awful, but he didn't stop doing that. That's why Keione told his smart friend, SaDDas to punish him! SaDDas took Tavas' headphones and told him: "If you solve the following problem, I'll return it to you."

The problem is:

You are given a lucky number n. Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

If we sort all lucky numbers in increasing order, what's the 1-based index of n?

Tavas is not as smart as SaDDas, so he asked you to do him a favor and solve this problem so he can have his headphones back.

Input

The first and only line of input contains a lucky number n (1 ≤ n ≤ 10⁹).

Output

Print the index of n among all lucky numbers.

Examples

Input

4

Output

1

Input

7

Output

2

Input

77

Output

6
题意：求小于等于的n的数中 只含有4，7的数字的个数
题解：dfs一下

 #include<bits/stdc++.h>
 using namespace std;
 #define ll __int64
 ll n;
 ll sum=;
 void dfs(ll x)
 {
     if(x<=n)
         sum++;
     else
         return ;
     dfs(x*+);
     dfs(x*+);
 }
 int main()
 {
     scanf("%I64d",&n);
     dfs();
     dfs();
     printf("%I64d\n",sum);
     return ;
 }

C. Tavas and Karafs

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.

Each Karafs has a positive integer height. Tavas has an infinite 1-based sequence of Karafses. The height of the i-th Karafs is s_i = A + (i - 1) × B.

For a given m, let's define an m-bite operation as decreasing the height of at most m distinct not eaten Karafses by 1. Karafs is considered as eaten when its height becomes zero.

Now SaDDas asks you n queries. In each query he gives you numbers l, t and m and you should find the largest number r such that l ≤ r and sequence s_l, s_l + 1, ..., s_r can be eaten by performing m-bite no more than t times or print -1 if there is no such number r.

Input

The first line of input contains three integers A, B and n (1 ≤ A, B ≤ 10⁶, 1 ≤ n ≤ 10⁵).

Next n lines contain information about queries. i-th line contains integers l, t, m (1 ≤ l, t, m ≤ 10⁶) for i-th query.

Output

For each query, print its answer in a single line.

Examples

Input

2 1 4
1 5 3
3 3 10
7 10 2
6 4 8

Output

4
-1
8
-1

Input

1 5 2
1 5 10
2 7 4

Output

1
2

题意：一个很迷的题意 有一个等差数列  从A开始  公差为B  然后n个询问  每个询问给定l,t,m   然后要求如果每次可以最多选择m个数   使这m个数-1   那么在t次操作中可以使l为左端点的最长序列中使所有数为0  输出这个最长序列的右端序号
题解： 序列h1,h2,...,hn 可以在t次时间内(每次至多让m个元素减少1)  全部减小为0  当且仅当 max(h1, h2, ..., hn) <= t  &&  h1 + h2 + ... + hn <= m*t   
二分右端点；

 

 #include<bits/stdc++.h>
 using namespace std;
 #define ll __int64
 ll a,b,n;
 ll l,t,m;
 bool fun(int x)
 {
     ll shou=a+(l-)*b;
     ll exm=a+(x-)*b;
     ll sum=(shou+exm)*(x-l+)/;
     if(exm<=t&&sum<=t*m)
         return true;
     else
         return false;
 }
 int main()
 {
     scanf("%I64d %I64d %I64d",&a,&b,&n);
     for(int i=;i<=n;i++)
     {
         scanf("%I64d %I64d %I64d",&l,&t,&m);
         ll left=l,right=1e6+,mid;
         ll flag=;
         while(left<=right)
         {
            mid=(left+right)/;
            if(fun(mid)){
             left=mid+;
             flag=;
             }
            else
             right=mid-;
         }
         if(flag==)
             printf("-1\n");
         else
         printf("%I64d\n",right);
     }
     return ;
 }