def computeBounds(faces, total):
maxTotal = sum(faces)
result = []
for face in faces:
upperBound = min(face, total - (len(faces) - 1))
lowerBound = max(1, total - maxTotal + face)
result.append(face - (upperBound - lowerBound + 1))
return result
size, total = map(int, input().split(' '))
faces = [int(i) for i in input().split(' ')]
bounds = computeBounds(faces, total)
print(' '.join([str(bound) for bound in bounds]))
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |
1321A - Contest for Robots | 1451A - Subtract or Divide |
1B - Spreadsheet | 1177A - Digits Sequence (Easy Edition) |
1579A - Casimir's String Solitaire | 287B - Pipeline |
510A - Fox And Snake | 1520B - Ordinary Numbers |
1624A - Plus One on the Subset | 350A - TL |
1487A - Arena | 1520D - Same Differences |
376A - Lever | 1305A - Kuroni and the Gifts |
1609A - Divide and Multiply | 149B - Martian Clock |