C :

#include<stdio.h>
int a[10001];
main()
{
	int m,n,i,j,t=0;
	scanf("%d%d",&m,&n);
	for(i=0;i<=m;i++)
	{
		for(j=0;j<=n;j++)
		{
			if(i*3+j*5>0)
			{
				a[i*3+j*5]++;
			}
		}
	}
	for(i=0;i<10000;i++)
	{
		if(a[i]!=0)
		{   
		    t++;
			printf("%d ",i);
		}
	}
	printf("\n%d",t);
}

C++ :

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

bool exist(int a[],int n,int x){
	bool f = false;
	int i;
	for (i = 0;i < n;i++){
		if (x == a[i]){
			f = true;
		}
	}
	return f;
}

int main(){
	int m,n,i,j,k = 0,money,t;
	bool f;
	cin>>m;
	cin>>n;
	int a[(m + 1) * (n + 1)];
	
	for (i = 0;i <= m;i++){
		for (j = 0;j <= n;j++){
			if (i + j != 0){
				money = i * 3 + j * 5;
				if (exist(a,n,money) == false){
					a[k] = money;
					k++;
				}
			}
		}
	}
	
	for (i = 1;i < k;i++){
		f = false;
		for (j = 0;j <= k - i - 1;j++){
			if (a[j] > a[j + 1]){
				t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
				f = true;
			}
		}
		if (f == false){
			break;
		}
	}
	
	for (i = 0;i < k;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
	cout<<k;
}

Pascal :

program liumohan;
var a,n,m,t,i,j,s:longint; p:array[0..100] of longint;
begin
  read(n,m);
  for i:=0 to n do
  for j:=0 to m do
  if (i*3+j*5)>0 then
  begin
    s:=s+1;
    p[s]:=i*3+j*5;
    end;
    
    for i:=1 to s do
    for j:=i+1 to s do
    if p[i]>p[j] then
    begin
      t:=p[i];
      p[i]:=p[j];
      p[j]:=t;
      end;
     for i:=1 to s do write(p[i],' ');
     writeln;
     writeln(s);
     end.

Java :

import java.util.Scanner;

public class Main {
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int m=sc.nextInt();
		int n=sc.nextInt();
		int[] a=new int[(m+1)*(n+1)-1];
		int c=0;
		for(int i=0;i<=m;i++){
			for(int j=0;j<=n;j++){
				if(i*3+j*5>0){
					a[c]=3*i+5*j;
					c++;
				}
			}
		}
		for(int i=0;i<c;i++){
			for(int j=1;j<c-i;j++){
				if(a[j]<a[j-1]){
					int t=a[j];
					a[j]=a[j-1];
					a[j-1]=t;
				}
			}
		}
		for(int i=0;i<c;i++){
			System.out.print(a[i]+" ");
		}
		
		System.out.println("\n"+c);
		
	}
	
}

Python :

sr=input().split()
m=int(sr[0])
n=int(sr[1])
js=0
a=[]
for i in range(m+1):
    for j in range(n+1):
        b=i*3+j*5
        if(b not in a and b!=0):
            a.append(b)
            js=js+1
a=sorted(a)
for i in a:
    print(i,end=" ")
print()
print(js)