from math import ceil
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b, a%b)
n,a,b=map(int,input().split())
x=list(map(int,input().split()))
for i in x:
maxpos = (i*a)//b
minreq = ceil((maxpos*b)/a)
print(i-minreq,end=' ')
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define endl '\n'
#define f(n) for(int i=0 ;i<n;i++)
#define fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
using namespace std;
int main()
{
fast
ll n,a,b; cin>>n>>a>>b;
ll arr[n];
f(n)cin>>arr[i];
f(n)cout<<((arr[i]*a)%b)/a<<" ";
return 0;
}307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |