def _input(): return map(int, input().split())
y, k, n = _input()
res= (y//k+1)*k-y
if res + y > n:
print(-1)
else:
while res + y<=n:
print(res, end = ' ')
res+=k
# include <bits\stdc++.h>
using namespace std;
int main()
{
int y,k,n;
cin>>y>>k>>n;
int remainder = y%k;
int rest_num = k-remainder;
bool flag = false;
if(y+rest_num <= n)
{
flag = true;
cout<<rest_num<<" ";
}
while(y+rest_num+k <= n)
{
flag = true;
cout<<rest_num+k<<" ";
rest_num = rest_num+k;
}
if(flag == false)
{
cout<<-1<<endl;
}
cout<<endl;
return 0;
}
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |