#include<bits/stdc++.h> 
using namespace std; 

int main() 
{ 
 int n, k; 
 cin>>n>>k; 
 int arr[n]; 
 for (int i=0; i<n; i++) 
  cin>>arr[i]; 

 // Current sum of the subarray 
 int curr_sum = 0; 

 // Starting and ending index of the maximum 
 // length subarray 
 int start_index = 0, end_index = 0; 
 int max_len = 0; 

 // Consider all subarrays and find the 
 // maximum length subarray having sum 
 // divisible by k 
 for (int i=0; i<n; i++) 
 { 
  curr_sum = 0; 

  // Consider all subarrays starting from i 
  // and ending at j 
  for (int j=i; j<n; j++) 
  { 
   curr_sum += arr[j]; 

   // If current sum is divisible by k then 
   // compare it with maximum length so far 
   if (curr_sum % k == 0 && (j-i+1) > max_len) 
   { 
    max_len = j-i+1; 
    start_index = i; 
    end_index = j; 
   } 
  } 
 } 

 // Print the subarray 
 for (int i=start_index; i<=end_index; i++) 
  cout << arr[i] << " "; 

 return 0; 
}