package leetcode.test;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class Test1 {
 public static void main(String[] args) {
 Scanner in = new Scanner(System.in);
 int n = in.nextInt();
 int m = in.nextInt();
 if (m < 5) {
 System.out.println("NA");
 }
 List<List<Integer>> res = new ArrayList<>();
 int a = 0;
 int b = 0;
 int c = 0;
 int k = 0;
 n = Math.max(3, n);
 for (int i = n; i < m; i++) {
 if (i%2 == 1) {
 // a = 2k+1 为奇数
 k = (i-1)/2;
 a = 2*k + 1;
 c = 2*k*k + 2*k + 1;
 if (a>=n && c<=m) {
 b = 2*k*k + 2*k;
 List<Integer> list = new ArrayList<>();
 list.add(a);
 list.add(b);
 list.add(c);
 res.add(list);
 }
 } else {
 // a=2*k 为偶数
 k = i/2;
 if (k>=3 && (k%2)!=1 ) {
 a = 2*k;
 c = k*k + 1;
 if (a>=n && c<=m) {
 b = k*k-1;
 List<Integer> list = new ArrayList<>();
 list.add(a);
 list.add(b);
 list.add(c);
 res.add(list);
 }
 }
 }
 }
 if (res.size() == 0) {
 System.out.println("NA");
 } else {
 res.stream().sorted(Comparator.comparingInt(o -> o.get(0))).forEach(list -> {
 String s = list.stream().map(String::valueOf).collect(Collectors.joining(" ", "", ""));
 System.out.println(s);
 });
 }
 }
}