Hierarchical and numerical ordering of strings made from delimited integers (C#)

Sorting is possible if you add n characters 0 between the digits.

Also You can use long and move the numbers n digits to the left, but then there will be a limit on the length of the number.

static void Main(string[] args)
{
    var chapter = new List<string>();
    chapter.Add("1_1_1");
    chapter.Add("1_1_12");
    chapter.Add("1_1_2");
    chapter.Add("1_2_1");
    chapter.Add("1_2_1_3_1");
    chapter.Add("1_2_2");
    var result = chapter.OrderBy(x=>SortCalc(x)).ToArray();
    foreach (var s in result)
    {
        Console.WriteLine($"{s}->{SortCalc(s)}");
    }
}

private static string SortCalc(string x, int count = 3)
{
    var array = x.Split('_').ToList();
    
    for (var index = 0; index < array.Count; index++)
    {
        var length = count - array[index].Length;
        if (length <=0)
            continue;
        array[index] = new string('0', length)+ array[index];
    }

    var num = string.Join("", array);
    return num;
}

Output will be

1_1_1->001001001
1_1_2->001001002
1_1_12->001001012
1_2_1->001002001
1_2_1_3_1->001002001003001
1_2_2->001002002