Codeforces Round #407 (Div. 2)(A,B)

A. Anastasia and pebbles

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple walking, so she began to collect Uzhlyandian pebbles. At first, she decided to collect all the pebbles she could find in the park.

She has only two pockets. She can put at most k pebbles in each pocket at the same time. There are n different pebble types in the park, and there are wi pebbles of the i-th type. Anastasia is very responsible, so she never mixes pebbles of different types in same pocket. However, she can put different kinds of pebbles in different pockets at the same time. Unfortunately, she can't spend all her time collecting pebbles, so she can collect pebbles from the park only once a day.

Help her to find the minimum number of days needed to collect all the pebbles of Uzhlyandian Central Park, taking into consideration that Anastasia can't place pebbles of different types in same pocket.

Input

The first line contains two integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ 109) — the number of different pebble types and number of pebbles Anastasia can place in one pocket.

The second line contains n integers w1, w2, ..., wn (1 ≤ wi ≤ 104) — number of pebbles of each type.

Output

The only line of output contains one integer — the minimum number of days Anastasia needs to collect all the pebbles.

Examples

input

3 2
2 3 4

output

3

input

5 4
3 1 8 9 7

output

5

Note

In the first sample case, Anastasia can collect all pebbles of the first type on the first day, of second type — on the second day, and of third type — on the third day.

Optimal sequence of actions in the second sample case:

• In the first day Anastasia collects 8 pebbles of the third type.
• In the second day she collects 8 pebbles of the fourth type.
• In the third day she collects 3 pebbles of the first type and 1 pebble of the fourth type.
• In the fourth day she collects 7 pebbles of the fifth type.

• In the fifth day she collects 1 pebble of the second type.
• 题目大意：她有两个袋子，每个袋子最多能装k个石块，而且每个袋子只能装同种石块，一天只能装一次，给你n种石块，每种ai个，问要多少一天能够将石块装完

• #include<cstdio>
  #include<cstdlib>
  #include<cstring>
  #include<iostream>
  #include<algorithm>
  using namespace std;
  const int maxn = 1e4 + 10;
  int main()
  {
  	int n,k;
  	scanf("%d%d",&n,&k);
  	int ans = 0;int temp = 0;
  	for(int i = 1; i <= n; i++)
      {
          int X;
          scanf("%d",&X);
          if(X <= k)
              temp++;
          else
          {
              ans += X / (2 * k);
              X = X % (2 * k);
              if(X != 0 && X <= k)//
                  temp++;
              else
                  if(X != 0)
                      ans++;
          }
      }
      cout << ans + (temp+1)/2 << endl;
  	return 0;
  }

B. Masha and geometric depression

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.

You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1, b2, b3, ..., where for each i > 1 the respective term satisfies the condition bi = bi - 1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m "bad" integersa1, a2, ..., am, and an integer l.

Masha writes all progression terms one by one onto the board (including repetitive) while condition |bi| ≤ l is satisfied (|x| means absolute value of x). There is an exception: if a term equals one of the "bad" integers, Masha skips it (doesn't write onto the board) and moves forward to the next term.

But the lesson is going to end soon, so Masha has to calculate how many integers will be written on the board. In order not to get into depression, Masha asked you for help: help her calculate how many numbers she will write, or print "inf" in case she needs to write infinitely many integers.

Input

The first line of input contains four integers b1, q, l, m (-109 ≤ b1, q ≤ 109, 1 ≤ l ≤ 109, 1 ≤ m ≤ 105) — the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of "bad" integers, respectively.

The second line contains m distinct integers a1, a2, ..., am (-109 ≤ ai ≤ 109) — numbers that will never be written on the board.

Output

Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or "inf" (without quotes) otherwise.

Examples

input

3 2 30 4
6 14 25 48

output

3

input

123 1 2143435 4
123 11 -5453 141245

output

0

input

123 1 2143435 4
54343 -13 6 124

output

inf

Note

In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a "bad" integer. Terms bigger than 24 won't be written because they exceed l by absolute value.

In the second case, Masha won't write any number because all terms are equal 123 and this is a "bad" integer.

In the third case, Masha will write infinitely integers 123.

题目大意：给你一个等差数列的首项b1和公比q，然后给你m个数ai和一个L；

　　　　　如果|bi| <= L 并且bi不等于任意一个ai，就在黑板上写下bi。让你输出黑板上bi的个数，如果写了无穷个，输入inf。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
const int maxn = 1e4 + 10;
int main()
{
	int q,l,m;
	__int64 b;
	scanf("%I64d%d%d%d",&b,&q,&l,&m);
	set<__int64 > S;
	S.clear();
	for(int i = 0; i < m; i++)
    {
        int x;
        scanf("%d",&x);
        S.insert(x);
    }
	if(q == 0)
    {
         if((S.find(b) == S.end() && S.find(0) != S.end() && abs(b) <= l))
                printf("1\n");
         else if((S.find(b) != S.end() && S.find((__int64)0) != S.end()) || abs(b) > l)
            printf("0\n");
         else
            printf("inf\n");
    }
    else if(abs(q) == 1)
    {
        if(q == 1)
        {
            if(S.find(b) == S.end() && abs(b) <= l)
                printf("inf\n");
            else
                printf("0\n");
        }
        else
        {
             if((S.find(b) == S.end() && abs(b) <= l) || (S.find(-b) == S.end() && abs(b) <= l))
                printf("inf\n");
             else
                printf("0\n");
        }
    }
    else
    {
        if(b == 0)
        {
            if(S.find(0) == S.end())
                printf("inf\n");
            else
                printf("0\n");
        }
        else{
            int ans = 0;
            while(abs(b) <= l)
            {
                if(S.find(b) == S.end())
                    ans++;
                b = b * q;
            }
            printf("%d\n",ans);
        }

    }
	return 0;
}