// sond 5.3.1.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"

#include <iostream>
#include <stdlib.h>
using namespace std;
//template <class type1, class type2>
int& find_min(int*, int);
//void* find_min(type1*, type2);
/*void* find_min(type1* a, type2 m)

{
    type1 *p = new type1[m], k;
    for(int i = 0; i<m; ++i)
        p[i] = a[i];
    for(int i = 0;i<m; ++i)
        for(int j =0; j< m-i-1; ++j)
            if(p[j]>p[j+1])
                swap(p[j],p[j+1]);
    int i =0;
    while(i<m-1 && p[i] != p[i+1]) ++i;
    if(p[i]!=p[i+1])
        k = p[0];
    else
        k = p[i];

    delete[] p;
    for(int i = 0;i<m;++i)
        if(a[i] == k) return (a+i);



}*/

int main()
{
    int m,k;
    //int m;
    cin >> m >> k;
    //cin>>m;
    int *a = new int[m];

    for(int i = 0;i<m;++i)
        a[i] = rand()%10;
    for(int i = 0;i<m;++i)
        cout << a[i] << " ";
    cout << endl;
    //int p = find_min(a, m);
   // void *p = find_min(a, m);
    find_min(a, m); = k;

    for(int i = 0;i<m;++i)
        cout << a[i] << " ";
    delete[] a;

    return 0;
}


int& find_min(int* a, int m)
//void* find_min(type1* a, type2 m)

{
    int *p = new int[m], k;
    for(int i = 0; i<m; ++i)
        p[i] = a[i];
    for(int i = 0;i<m; ++i)
        for(int j =0; j< m-i-1; ++j)
            if(p[j]>p[j+1])
                swap(p[j],p[j+1]);
    int i =0;
    while(i<m-1 && p[i] != p[i+1]) ++i;
    if(p[i]!=p[i+1])
        k = p[0];
    else
        k = p[i];

    delete[] p;
    for(int i = 0;i<m;++i)
        if(a[i] == k) return a[i];
}