C :

#include "stdio.h"
int n,m;
int a[100];
int main()
{
	int i;
	scanf("%d%d",&n,&m);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	printf("45\n");
	return 0;
}

C++ :

#include "iostream"
#include "algorithm"
using namespace std;
int n,m;
int a[100];
int f[10000000];
int main()
{
	int i,j,t;
	scanf("%d%d",&n,&m);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	sort(a,a+n);
	t=0;
	f[1]=1;
	i=1;
	while(t<m)
	{
		i++;
		for(j=0;j<n;j++)
			if(i%a[j]==0&&f[i/a[j]])
			{
				printf("i=%d\n",i);
				f[i]=1;
				t++;
				break;
			}
	}
	printf("%d\n",i);
	return 0;
}

Pascal :

var i,j,k,n,min:longint;
    a,c:array[0..101] of longint;
    b:array[0..100001] of longint;
function choosemin(a,b:longint):longint;
begin
  if a<b then exit(a) else exit(b);
end;
begin
  //assign(input,'humble.in');
  //assign(output,'humble.out');
  //reset(input);
  //rewrite(output);
  readln(k,n);
  for i:=1 to k do read(a[i]);
  b[0]:=1;
  for i:=1 to n do
   begin
    min:=maxlongint;
    for j:=1 to k do
     begin
      while a[j]*b[c[j]]<=b[i-1] do inc(c[j]);
      min:=choosemin(min,a[j]*b[c[j]]);
     end;
    b[i]:=min;
   end;
  writeln(b[n]);
  //close(input);
  //close(output);
end.