codeforces 415B Mashmokh and Tokens

B. Mashmokh and Tokens

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Bimokh is Mashmokh's boss. For the following n days he decided to pay to his workers in a new way. At the beginning of each day he will give each worker a certain amount of tokens. Then at the end of each day each worker can give some of his tokens back to get a certain amount of money. The worker can save the rest of tokens but he can't use it in any other day to get more money. If a worker gives back w tokens then he'll get  dollars.

Mashmokh likes the tokens however he likes money more. That's why he wants to save as many tokens as possible so that the amount of money he gets is maximal possible each day. He has n numbers x1, x2, ..., xn. Number xi is the number of tokens given to each worker on the i-th day. Help him calculate for each of n days the number of tokens he can save.

Input

The first line of input contains three space-separated integers n, a, b (1 ≤ n ≤ 105; 1 ≤ a, b ≤ 109). The second line of input contains nspace-separated integers x1, x2, ..., xn (1 ≤ xi ≤ 109).

Output

Output n space-separated integers. The i-th of them is the number of tokens Mashmokh can save on the i-th day.

Examples

input

5 1 4
12 6 11 9 1

output

0 2 3 1 1 

input

3 1 2
1 2 3

output

1 0 1 

input

1 1 1
1

output

0 

题意是用token去换钱..  是w*a/b向下取整，在换到最多钱的同时留下最多token..

最多换到的钱为w*a/b，因为会有余数所以要求出x<w使得x换出来的钱也是w*a/b

所以w*a%b便能求出其余数..然后用余数除a就得出余数所占得token..

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define N  100000
int main()
{
    long long int t[N],p[N],a,b,n,i,j;
    scanf("%lld %lld %lld",&n,&a,&b);
    	for(i=1;i<=n;i++)
    	{
    		cin>>t[i];
    		p[i]=((t[i]*a)%b)/a;
		} 
		
		for(i=1;i<=n;i++)
		{
			cout<<p[i];
			if(i!=n)
			cout<<" ";
		}
		cout<<endl;
	return 0;
}