import java.util.Scanner;
import java.util.HashMap;
import java.util.List;
import java.util.Arrays;
import java.util.ArrayList;
import java.lang.Math;

public class Main {

    private static Scanner sc = new Scanner(System.in);

    private static int mod = (int) 10e9 + 7;

    public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    }

    private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

    private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

} import java.util.Scanner; Scanner java.util import java.util.HashMap; HashMap java.util import java.util.List; List java.util import java.util.Arrays; Arrays java.util import java.util.ArrayList; ArrayList java.util import java.lang.Math; Math java.lang public class Main {

    private static Scanner sc = new Scanner(System.in);

    private static int mod = (int) 10e9 + 7;

    public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    }

    private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

    private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

} Main private static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) private static int mod = (int) 10e9 + 7; mod (int) 10e9 + 7 (int) 10e9 7 public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    } main {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    } int k = sc.nextInt(); k sc.nextInt() sc.nextInt sc int x = sc.nextInt(); x sc.nextInt() sc.nextInt sc for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        } int i = x -  k + 1; int i = x -  k + 1; i x -  k + 1 x -  k x k 1 i < x + k i x + k x k i++ i++ i {
            System.out.println(i);
        } {
            System.out.println(i);
        } System.out.println(i) System.out.println System.out System System.out i String[] args args private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    } maxInt {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    } int max = array[0]; max array[0] array 0 for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        } int i = 1; int i = 1; i 1 i < array.length i array.length array array.length i++ i++ i {
            if (max < array[i]) max = array[i];
        } {
            if (max < array[i]) max = array[i];
        } if (max < array[i]) max = array[i]; max < array[i] max array[i] array i max = array[i] max array[i] array i return max; max int[] array array private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    } maxLong {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    } long max = array[0]; max array[0] array 0 for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        } int i = 1; int i = 1; i 1 i < array.length i array.length array array.length i++ i++ i {
            if (max < array[i]) max = array[i];
        } {
            if (max < array[i]) max = array[i];
        } if (max < array[i]) max = array[i]; max < array[i] max array[i] array i max = array[i] max array[i] array i return max; max long[] array array private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    } minInt {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    } int min = array[0]; min array[0] array 0 for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        } int i = 1; int i = 1; i 1 i < array.length i array.length array array.length i++ i++ i {
            if (min > array[i]) min = array[i];
        } {
            if (min > array[i]) min = array[i];
        } if (min > array[i]) min = array[i]; min > array[i] min array[i] array i min = array[i] min array[i] array i return min; min int[] array array private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    } minLong {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    } long min = array[0]; min array[0] array 0 for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        } int i = 1; int i = 1; i 1 i < array.length i array.length array array.length i++ i++ i {
            if (min > array[i]) min = array[i];
        } {
            if (min > array[i]) min = array[i];
        } if (min > array[i]) min = array[i]; min > array[i] min array[i] array i min = array[i] min array[i] array i return min; min long[] array array public class Main {

    private static Scanner sc = new Scanner(System.in);

    private static int mod = (int) 10e9 + 7;

    public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    }

    private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

    private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

} public class Main {

    private static Scanner sc = new Scanner(System.in);

    private static int mod = (int) 10e9 + 7;

    public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    }

    private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

    private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

} Main
import java.util.Scanner;
import java.util.HashMap;
import java.util.List;
import java.util.Arrays;
import java.util.ArrayList;
import java.lang.Math;

public class Main {

    private static Scanner sc = new Scanner(System.in);

    private static int mod = (int) 10e9 + 7;

    public static void main(String[] args) {
        int k = sc.nextInt();
        int x = sc.nextInt();
        for (int i = x -  k + 1; i < x + k; i++) {
            System.out.println(i);
        }
    }

    private static int maxInt(int[] array) {
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static long maxLong(long[] array) {
        long max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]) max = array[i];
        }
        return max;
    }

    private static int minInt(int[] array) {
        int min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

    private static long minLong(long[] array) {
        long min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (min > array[i]) min = array[i];
        }
        return min;
    }

}
